#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:100000000")
using namespace std;
vector<vector<int>> g;
vector<bool> c;
int answer = 0;
void dfs(int x) {
  if (c[x] == true) return;
  c[x] = true;
  for (int i = 0; i < g[x].size(); ++i)
    if (!c[g[x][i]]) dfs(g[x][i]);
  if (g[x].size() == 0) ++answer;
}
int main() {
  int n;
  cin >> n;
  g.resize(200001);
  c.resize(200001);
  for (int i = 0; i < n; i++) {
    int q;
    cin >> q;
    g[q].push_back(i + 1);
  }
  for (int i = 0; i < n; i++)
    if (!c[i]) dfs(i);
  cout << answer;
  return 0;
}
