#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int lst[N], vis[N], t[N];
vector<int> g[N];
int dfs(int u) {
  vis[u] = 1;
  for (auto p : g[u]) {
    if (!vis[p]) {
      dfs(p);
    }
  }
  return 0;
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, i;
  cin >> n;
  for (i = 1; 1 < n + 1 ? i < n + 1 : i > n + 1; 1 < n + 1 ? i += 1 : i -= 1) {
    cin >> t[i];
  }
  for (i = n; n < 0 ? i < 0 : i > 0; n < 0 ? i += 1 : i -= 1) {
    if (lst[i]) {
      g[i].push_back(lst[i]);
    }
    lst[t[i]] = i;
  }
  int cnt = 0;
  for (i = 1; 1 < n + 1 ? i < n + 1 : i > n + 1; 1 < n + 1 ? i += 1 : i -= 1) {
    if (!vis[i]) {
      cnt++;
      dfs(i);
    }
  }
  cout << cnt << endl;
  return 0;
}
