#include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
map<int, int> M;
int n, t[maxn], cur;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &t[i]);
  cur = 1;
  M[0] = 1;
  for (int i = 1; i <= n; i++) {
    if (!M.count(t[i]) || M[t[i]] <= 0) {
      M[i]++;
      cur++;
    } else {
      M[t[i]]--;
      M[i]++;
    }
  }
  printf("%d\n", cur);
  return 0;
}
