Feedback | | If you notice incorrect translations in Contester, please let author know.
|
|
Time limit 3000/4000/4000/5000 ms. Memory limit 65000/65000/65000/65000 Kb.
Difficulty Alpha
You are given a list of n integers, and your task is to calculate the number of distinct values in the list.
Input
The first input line has an integer n: the number of values.
The second line has n integers x1,x2,…,xn.
Output
Print one integers: the number of distinct values.
Constraints
1≤n≤2⋅105
1≤xi≤109
Example
Input:
5
2 3 2 2 3
Output:
2
Для отправки решений необходимо выполнить вход.
|