#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 1e6 + 5;
long long int power(long long int base, long long int exp) {
  long long int res = 1;
  while (exp) {
    if (exp % 2) res *= base;
    base *= base;
    res %= mod;
    base %= mod;
    exp /= 2;
  }
  return res;
}
int t[maxn], ans[maxn], last[maxn];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int i, n;
  cin >> n;
  for (i = 1; i <= n; i++) cin >> t[i];
  ans[0] = 1;
  last[1] = 0;
  int curr = 1;
  for (i = 1; i <= n; i++) {
    if (last[ans[t[i]]] == t[i]) {
      ans[i] = ans[t[i]];
      last[ans[i]] = i;
    } else {
      ans[i] = ++curr;
      last[curr] = i;
    }
  }
  cout << curr;
  return 0;
}
