The store warden Omkar has been asked to compute the guild dues owed. On the desk lies a long table of readings readings. 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 <= 831; -1000000 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 831; -1000000 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.
