#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
const int INF = 1000050000;
const long long LINF = 1000000000000050000LL;
using namespace std;
const int MAXN = 200500;
int n;
int t[MAXN];
int in[MAXN], out[MAXN];
void init() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &t[i]);
  }
}
void solve() {
  init();
  for (int i = 1; i <= n; ++i) {
    ++in[t[i]];
  }
  int ans = 1;
  for (int i = 0; i <= n; ++i) {
    if (in[i] > 1) {
      ans += in[i] - 1;
    }
  }
  printf("%d\n", ans);
}
int main() {
  iostream::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
