#include <iostream>
#include <queue>
using namespace std;

int main(){
    int n;
    priority_queue<int> as;
    cin >> n;
    for (int i = 0; i < n; i++){
        int a;
        cin >> a;
        as.push(a);
    }
    int prev = -1;
    int ans = 0;
    int cnt = 0;
    for (int i = 0; i < n; i++){
        if (prev == as.top()){
            cnt++;
        }
        else {
            if (cnt == 1){
                ans++;
            }
            prev = as.top();
            cnt = 1;
        }
        as.pop();
    }
    if (cnt == 1)
        ans++;
    cout << ans << endl;
    return 0;
}