In the opal reefs of Shimmerdeep, Jace the dispatch writer keeps careful count of the stamps. Inspect the delivered goods, every figure matters. 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 <= 272; -100 <= a[i] <= 1000000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 272; -100 <= a[i] <= 1000000; answers fit a signed 64-bit integer.
