The council of the willow walks of Reedmarsh pays by the answer, and Tara intends to earn it. First: the full register of readings. Task: Read n integers and print the difference between the largest and smallest. Input format: First line: n. Second line: n space-separated integers. Output format: Print max(a) - min(a). Constraints: 1 <= n <= 497; -100 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 497; -100 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.
