#include<bits/stdc++.h>
using namespace std;

int main(){
    int N, in,ans=0;
    vector<int> v;

    cin >> N;
    while(cin >> in) v.push_back(in);
    sort(v.begin(),v.end());

    int pre = 0;
    for(int i=0;i<N-1;i++){
        if(v[i]!=v[i+1] && pre!=v[i]) ans++;
        pre = v[i];
    }
    if(pre!=v.back()) ans++;

    cout << ans << endl;

    return 0;
}