#include <bits/stdc++.h>
using namespace std;
const long long maxn = 200005;
long long n, has;
long long num[maxn], rk[maxn];
long long a[maxn];
signed main() {
  long long k, j, i;
  scanf("%lld", &n);
  for (k = 1; k <= n; k++) scanf("%lld", &a[k]);
  rk[0] = 1;
  num[1] = 0;
  has = 1;
  for (k = 1; k <= n; k++) {
    if (rk[a[k]])
      rk[k] = rk[a[k]], rk[a[k]] = 0, num[rk[k]] = k;
    else {
      num[++has] = k, rk[k] = has;
    }
  }
  cout << has << endl;
  return 0;
}
