#include <bits/stdc++.h>
using namespace std;
int main() {
  long n;
  cin >> n;
  map<long, long> m;
  for (int i = 0; i < n; i++) {
    long a;
    cin >> a;
    if (m.find(a) == m.end())
      m.insert({a, 0});
    else
      m[a]++;
  }
  map<long, long>::iterator it;
  it = m.begin();
  long ans = 0;
  long z = 0;
  while (it != m.end()) {
    ans += max(z, it->second);
    it++;
  }
  cout << ans + 1 << endl;
  return 0;
}
