#include <bits/stdc++.h>
using namespace std;
const int N = 200002;
int n, a[N];
int main() {
  scanf("%d", &n);
  multiset<int> second;
  second.insert(0);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
    if (second.find(a[i]) != second.end()) second.erase(second.find(a[i]));
    second.insert(i);
  }
  cout << ((int)(second).size());
}
