#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int arr[n];
  unordered_set<int> s;
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    if (arr[i] <= n) s.insert(arr[i]);
  }
  cout << n - s.size();
}
