#include <bits/stdc++.h>
#include "bits/stdc++.h"
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <unordered_map>
#include <string.h>
#include <utility>

typedef long long ll;
const int INF = 1e8;

#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;

typedef pair<int, int> P;

map<ll,ll> mp;


int main() {

	int n = 0;
	cin >> n;

	int tmp;

	int ct=0;

	for (int i = 0; i < n; i++) {
		cin >> tmp;

		mp[tmp]++;

	}

	map<ll,ll>::iterator itr;

	for(itr = mp.begin(); itr != mp.end(); itr++){
		if(itr->second ==1){
			ct++;
		}
	}

	cout<<ct<<endl;

	return 0;
}