{"raw_statement":[{"iden":"problem statement","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."},{"iden":"constraints","content":"*   $1 ≤ N ≤ 100$\n*   $0 ≤ a_i ≤ 1000$\n*   $a_i$ is an integer."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$a_1$ $a_2$ $...$ $a_N$"},{"iden":"sample input 1","content":"4\n2 3 7 9"},{"iden":"sample output 1","content":"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."},{"iden":"sample input 2","content":"8\n3 1 4 1 5 9 2 6"},{"iden":"sample output 2","content":"8\n\nThere may be more than one house at a position."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}