#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2 * 100 * 1000 + 19;
const int inf = 2e9 + 19;
int n, ans;
bool mark[MAX_N];
vector<int> g[MAX_N];
int dfs(int v) {
  mark[v] = true;
  if (!(int)g[v].size()) return 1;
  int res = 0;
  for (auto u : g[v])
    if (!mark[u]) res += dfs(u);
  return res;
}
int main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n;
  for (int i = 0, v; i < n; i++) cin >> v, g[--v].push_back(i);
  for (int i = 0; i < n; i++)
    if (!mark[i]) ans += dfs(i);
  cout << ans;
  return (0);
}
