#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1010;
int get_unique_count(int a[], int n)
{
int cnt = 1;
for (int i = 1; i < n; i ++ )
if (a[i] != a[i - 1]) //数组排序后可以将当前元素与上一元素比较来判断是否是重复元素
cnt ++ ;
return cnt;
}
int main()
{
int n;
cin >> n;
int a[N];
for (int i = 0; i < n; i ++ ) cin >> a[i];
sort(a, a + n);
cout << get_unique_count(a, n) << endl;
return 0;
}