#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int n;
int t[N];
int nxt[N];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", t + i);
  int logs = 0;
  for (int i = n; i >= 1; --i) {
    if (nxt[i] == 0) nxt[i] = i;
    nxt[t[i]] = nxt[i];
  }
  set<int> st;
  for (int i = 1; i <= n; ++i) st.emplace(nxt[i]);
  int ans = (int)st.size();
  printf("%d\n", ans);
  return 0;
}
