#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, result = 1, i, t;
  scanf("%d", &n);
  set<int> canUse;
  canUse.insert(0);
  for (i = 0; i < n; i = i + 1) {
    scanf("%d", &t);
    if (canUse.find(t) != canUse.end())
      canUse.erase(t);
    else
      result = result + 1;
    canUse.insert(i + 1);
  }
  printf("%d\n", result);
  return 0;
}
