#include <bits/stdc++.h>
using namespace std;
int n, p;
map<int, int> m;
int main() {
  scanf("%d", &n);
  m[0] = 1;
  p = 1;
  int last = 1;
  for (int i = (1); i <= (n); i++) {
    int x;
    scanf("%d", &x);
    if (!m[x]) {
      last = ++p;
    } else {
      last = m[x];
      m[x] = 0;
    }
    m[i] = last;
  }
  printf("%d\n", p);
}
