#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
const int MAXN = 200000;
int n;
int a[MAXN];
void run() {
  scanf("%d", &n);
  for (int i = (0); i < (n); ++i) scanf("%d", &a[i]);
  sort(a, a + n);
  int ndiff = unique(a, a + n) - a;
  int ret = n + 1 - ndiff;
  printf("%d\n", ret);
}
int main() {
  run();
  return 0;
}
