#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>

using namespace std;

int main() {
	int n, in;

	cin >> n;
	set<int> a, b;
	for (int i = 0; i < n; i++) {
		cin >> in;
		if (a.count(in) > 0) {
			b.insert(in);
		} else {
			a.insert(in);
		}
	}

	int ans = a.size() - b.size();

	cout << ans << endl;
	return 0;
}