#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
void solve() {
  int n, x;
  cin >> n;
  vector<bool> a(n, true);
  map<int, int> mp;
  for (long long i = 0; i < n; ++i) {
    cin >> x;
    mp[x - 1] = 1;
  }
  int sum = 0;
  for (long long i = 0; i < n; ++i)
    if (mp[i] == 0) sum++;
  cout << sum;
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
  solve();
}
