At the honey farms of Buzzwell, Galen records each lanterns in a worn leather ledger. The guild wants answers, not guesses. Task: Read n integers and print the number of distinct values. Input format: First line: n. Second line: n space-separated integers. Output format: Print the count of distinct values. Constraints: 1 <= n <= 710; -100 <= a[i] <= 1000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 710; -100 <= a[i] <= 1000; answers fit a signed 64-bit integer.
