#include <iostream>
#include <unordered_map>
using namespace std;
int goodSequence(int a[], int n) {
unordered_map<int, int> count;
int remove = 0;
for (int i = 0; i < n; i++) {
count[a[i]]++;
}
for (auto x : count) {
remove += abs(x.first - x.second);
}
return remove;
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << goodSequence(a, n) << endl;
return 0;
}