#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
const int N = 2e5 + 5;
int n, t[N], vis[N];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", &t[i]);
  int ans = 0;
  for (int i = n; i >= 1; --i)
    if (!vis[i]) {
      vis[i] = 1;
      ans++;
      int p = i;
      while (p) {
        p = t[p];
        if (vis[p]) break;
        vis[p] = 1;
      }
    }
  printf("%d\n", ans);
  return 0;
}
