{"problem":{"name":"Traveling AtCoDeer Problem","description":{"content":"It is only six months until Christmas, and AtCoDeer the reindeer is now planning his travel to deliver gifts.   There are $N$ houses along _TopCoDeer street_. The $i$\\-th house is located at coordinat","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc064_b"},"statements":[{"statement_type":"Markdown","content":"It is only six months until Christmas, and AtCoDeer the reindeer is now planning his travel to deliver gifts.  \nThere are $N$ houses along _TopCoDeer street_. The $i$\\-th house is located at coordinate $a_i$. He has decided to deliver gifts to all these houses.  \nFind the minimum distance to be traveled when AtCoDeer can start and end his travel at any positions.\n\n## Constraints\n\n*   $1 ≤ N ≤ 100$\n*   $0 ≤ a_i ≤ 1000$\n*   $a_i$ is an integer.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$a_1$ $a_2$ $...$ $a_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc064_b","tags":[],"sample_group":[["4\n2 3 7 9","7\n\nThe travel distance of $7$ can be achieved by starting at coordinate $9$ and traveling straight to coordinate $2$.  \nIt is not possible to do with a travel distance of less than $7$, and thus $7$ is the minimum distance to be traveled."],["8\n3 1 4 1 5 9 2 6","8\n\nThere may be more than one house at a position."]],"created_at":"2026-03-03 11:01:14"}}