#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 100;
int pre[maxn], vis[maxn];
int main() {
  memset(vis, 0, sizeof(vis));
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &pre[i]);
  int ans = 0;
  for (int i = n; i > 0; i--) {
    if (vis[i] == 0) ans++;
    vis[i] = 1;
    int u = pre[i];
    while (1) {
      vis[u] = 1;
      if (vis[u] == 1 || u == 0) break;
    }
  }
  printf("%d\n", ans);
  return 0;
}
