The auditor Gautam has been asked to reconcile two mismatched ledgers. On the desk lies a long table of scrolls 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 <= 999; 0 <= a[i] <= 1000000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 999; 0 <= a[i] <= 1000000; answers fit a signed 64-bit integer.
