#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define rep(i,x) for(int i=0;i<(int)(x);++i)
#define reps(i,x) for(int i=1;i<=(int)(x);++i)
#define rrep(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define rreps(i,x) for(int i=((int)(x));i>0;i--)
#define pb push_back

int n, a;
map<int, int> m;

vi map_vals(map<int, int> M){
    vi ret;
    map<int, int>::iterator itr;
    for (itr = M.begin(); itr != M.end(); ++itr) {
        ret.pb(itr->second);
    }
    return ret;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n;
    rep(i, n) {
        cin >> a;
        m[a]++;
    }
    vi mm = map_vals(m);
    cout << count(mm.begin(), mm.end(), 1) << "\n";
    return 0;
}