#include <bits/stdc++.h>
using namespace std;
int n, counter, ans;
vector<int> v;
void solve() {
  ans = 0;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int b;
    cin >> b;
    v.push_back(b);
  }
  sort(v.begin(), v.end());
  for (int i = 0; i < n; i++) {
    if ((v[i] != v[i + 1] && v[i] <= n)) {
      ans++;
    }
  }
  cout << n - ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
}
