#include <bits/stdc++.h>
using namespace std;
const int N = 2 * 1e5 + 10;
int a[N];
int room;
vector<int> v;
int main() {
  int n, sn;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  room = 1;
  v.push_back(1);
  for (int i = 2; i <= n; i++) {
    sn = lower_bound(v.begin(), v.end(), a[i]) - v.begin();
    if (v[sn] == a[i]) {
      v.erase(v.begin() + sn);
      v.push_back(i);
    } else {
      room++;
      v.push_back(i);
    }
  }
  printf("%d\n", room);
}
