#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 4;
const int maxlog = 31;
const long long mod = 1e9 + 7;
const int sq = 1000;
const int inf = 1e9 + 43;
const long double pi = 3.1415926535897932384626433832795028841971693993751;
int f[maxn];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout.precision(20);
  int n;
  cin >> n;
  f[0] = 1;
  int cnt = 1;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    if (f[x]) {
      int y = f[x];
      f[i] = y;
      f[x] = 0;
    } else {
      f[i] = cnt + 1;
      cnt++;
    }
  }
  cout << cnt;
  return 0;
}
