output_description: Print the minimum distance to be traveled.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      a_1 a_2 ... a_N
attempt: n = int(input())
  a = map(int, input()split())
  print(max(a)-min(a))
problem_description: Statement
  
  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
  coordinate a_i. He has decided to deliver gifts to all these houses.  
  Find the minimum distance to be traveled when AtCoDeer can start and end his
  travel at any positions.
samples: [{"input": "4\n    2 3 7 9", "output": "7\n    \n\nThe travel distance of 7 can be achieved by starting at coordinate 9 and\ntraveling straight to coordinate 2.  \nIt is not possible to do with a travel distance of less than 7, and thus 7 is\nthe minimum distance to be traveled.\n\n* * *"}, {"input": "8\n    3 1 4 1 5 9 2 6", "output": "8\n    \n\nThere may be more than one house at a position."}]