#include <bits/stdc++.h>
const long long INFLL = 1e18;
using namespace std;
const int MAXN = 2 * 100000;
const int INF = 1000 * 1000 * 1000;
int a[MAXN + 1], used[MAXN + 10];
int main() {
  int n;
  scanf("%d", &n);
  int ans = 1;
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    if (used[a[i]]) {
      ans++;
    }
    used[a[i]] = 1;
  }
  cout << ans << "\n";
  return 0;
}
