#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const long long INFL = 9223372036854775807LL;
const double EPSILON = 0.00000001;
const long long MOD = 1000000007;
int last_used[200000 + 5];
int rec[200000 + 5];
int rooms[200000 + 5];
int32_t main() {
  memset(last_used, -1, sizeof(last_used));
  ;
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    scanf("%d", &rec[i + 1]);
    ;
  }
  int cur_room = 0;
  last_used[0] = 0;
  rooms[0] = 0;
  for (int t = 1; t <= n; t++) {
    int room = rooms[rec[t]];
    if (last_used[room] == rec[t]) {
      last_used[room] = t;
      rooms[t] = room;
    } else {
      cur_room++;
      rooms[t] = cur_room;
      last_used[cur_room] = t;
    }
  };
  cout << cur_room + 1 << endl;
  return 0;
}
