#include <bits/stdc++.h>
using namespace std;
const double pi =
    3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342;
int main() {
  map<int, int> M;
  int n;
  scanf("%d", &n);
  M[0] = 1;
  for (int i = 0; i < (n); ++i) {
    int a;
    scanf("%d", &a);
    if (M.find(a) != M.end()) {
      M[i + 1] = M[a];
      M.erase(a);
    } else
      M[i + 1] = M.size() + 1;
  }
  printf("%d\n", M.size());
  return 0;
}
