#include <bits/stdc++.h>
using namespace std;
void find() {
  int n;
  cin >> n;
  vector<int> arr(n);
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  unordered_map<int, int> m;
  m[1] = 0;
  int ans = 1;
  unordered_map<int, int> last;
  last[0] = 1;
  int k = 1;
  for (int i = 0; i < n; i++) {
    int min = i + 1;
    if (last.find(arr[i]) == last.end()) {
      ans++;
      k++;
      last[min] = k;
    } else {
      int l = last[arr[i]];
      last.erase(arr[i]);
      last[min] = k;
    }
  }
  cout << ans << endl;
}
int main() { find(); }
