#include <bits/stdc++.h>
using namespace std;
long long n;
long long t[200010];
set<long long> st;
int main() {
  scanf("%lld", &n);
  for (long long i = (long long)(0); i < (long long)(n); i++)
    scanf("%lld", t + i);
  long long res = 1;
  st.insert(0);
  for (long long i = (long long)(0); i < (long long)(n); i++) {
    if (st.find(t[i]) == st.end()) {
      res++;
      st.insert(i + 1);
    } else {
      st.erase(t[i]);
      st.insert(i + 1);
    }
  }
  cout << res << endl;
  return 0;
}
