Every season at the tulip beds of Bloomhaven, someone must balance the workshop's books. This year the task falls to Axel, armed only with the coins register. 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 <= 96; -100 <= a[i] <= 10; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 96; -100 <= a[i] <= 10; answers fit a signed 64-bit integer.
