#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cctype>
using namespace std;
typedef long long ll;

int main()
{
	int n, a;
	vector<int>v;
	set<int>s, t;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> a;
		v.push_back(a);
		if (s.find(a) == s.end())s.insert(a);
		else t.insert(a);
	}
	int sum = 0;
	for (int i = 0; i < n; i++)
	{
		if (t.find(v[i]) == t.end())sum++;
	}
	cout << sum << endl;
	return 0;
}