Distinct Numbers CSES Solution with Explanation | CSES Problem Set

 

Distinct Numbers

You are given a list of n$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$n$: the number of values.

The second line has n$n$ integers x1,x2,…,xn$x_1,x_2,\dots ,x_n$.

Output

Print one integers: the number of distinct values.

Constraints

• 1≤n≤2⋅105$1\le n\le 2\cdot {10}^5$
  
• 1≤xi≤109$1\le x_i\le {10}^9$
  

Example

Input:
5
2 3 2 2 3

Output:
2




void solve() {

// n is the size of array

int n;

cin>>n;

// map to store the unique elements and its frequency

map<int,int>m;

for (int i = 0; i < n; i++)

{

    int x;

    cin>>x;

    m[x]++;

}

// total unique elements is the size of the map

cout<<m.size()<<endl;

}