n = int(input())
a = set(map(int, input().split()))
counter = 0
for i in range(n):
if i + 1 not in a:
counter += 1
print(counter)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl "\n"
#define ff first
#define ss second
#define pb push_back
double pi = 3.14159;
const int N = 105;
void solve() {
int n;
cin >> n;
int a[n + 1], freq[5005] = {0};
int ans = 0;
for(int i = 1; i <= n; i++) {
cin >> a[i];
freq[a[i]]++;
if(a[i] > n) {
ans++;
}
}
for(int i = 1; i <= n; i++) {
ans += max(freq[i], 1) - 1;
}
cout << ans;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// int t;
// cin>>t;
// while(t--)
solve();
}
2110. Number of Smooth Descent Periods of a Stock | 2109. Adding Spaces to a String |
2108. Find First Palindromic String in the Array | 394. Decode String |
902. Numbers At Most N Given Digit Set | 221. Maximal Square |
1200. Minimum Absolute Difference | 1619B - Squares and Cubes |
1619A - Square String | 1629B - GCD Arrays |
1629A - Download More RAM | 1629C - Meximum Array |
1629D - Peculiar Movie Preferences | 1629E - Grid Xor |
1629F1 - Game on Sum (Easy Version) | 2148. Count Elements With Strictly Smaller and Greater Elements |
2149. Rearrange Array Elements by Sign | 2150. Find All Lonely Numbers in the Array |
2151. Maximum Good People Based on Statements | 2144. Minimum Cost of Buying Candies With Discount |
Non empty subsets | 1630A - And Matching |
1630B - Range and Partition | 1630C - Paint the Middle |
1630D - Flipping Range | 1328A - Divisibility Problem |
339A - Helpful Maths | 4A - Watermelon |
476A - Dreamoon and Stairs | 1409A - Yet Another Two Integers Problem |