#include <iostream>
#include <cassert>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;

int main() {
	int n;
	cin >> n;
	vector<int> a(n);
	for (int i = 0; i < n; ++i) cin >> a[i];
	
	assert(1 <= n && n <= 200000);
	for (int i = 0; i < n; ++i) assert(1 <= a[i] && a[i] <= n);
	
	sort(a.begin(), a.end());
	a.erase(unique(a.begin(), a.end()), a.end());
	cout << n - a.size() << endl;
}