At the rook towers of Chessfield, Qadir records each barrels in a worn leather ledger. The guild wants answers, not guesses. 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 <= 854; -100 <= a[i] <= 10; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 854; -100 <= a[i] <= 10; answers fit a signed 64-bit integer.
