1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
#include<bits/stdc++.h>
using namespace std;
const int MOD = 2333;
int ans = 0, num, mo;
vector<int> hash[MOD + 10];

void insert(int a) {
mo = a % MOD;
for (int i = 0; i < hash[mo].size(); i++)
if (hash[mo][i] == a)
return;
ans++;
hash[mo].push_back(a);
}

int main() {
int n;
int a;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a), insert(a);
printf("%d\n", ans);
return 0;
}