1 //
 2 //by coolxxx
 3 //#include<bits/stdc++.h>
 4 #include<iostream>
 5 #include<algorithm>
 6 #include<string>
 7 #include<iomanip>
 8 #include<map>
 9 #include<stack>
10 #include<queue>
11 #include<set>
12 #include<bitset>
13 #include<memory.h>
14 #include<time.h>
15 #include<stdio.h>
16 #include<stdlib.h>
17 #include<string.h>
18 //#include<stdbool.h>
19 #include<math.h>
20 #define min(a,b) ((a)<(b)?(a):(b))
21 #define max(a,b) ((a)>(b)?(a):(b))
22 #define abs(a) ((a)>0?(a):(-(a)))
23 #define lowbit(a) (a&(-a))
24 #define sqr(a) ((a)*(a))
25 #define swap(a,b) ((a)^=(b),(b)^=(a),(a)^=(b))
26 #define mem(a,b) memset(a,b,sizeof(a))
27 #define eps (1e-8)
28 #define J 10
29 #define mod 1000000007
30 #define MAX 0x7f7f7f7f
31 #define PI 3.14159265358979323
32 #define N 100004
33 using namespace std;
34 typedef long long LL;
35 int cas,cass;
36 int n,m,lll,ans;
37 int h[N];
38 bool cmp(int a,int b)
39 {
40     return a<b;
41 }
42 int main()
43 {
44     #ifndef ONLINE_JUDGE
45 //    freopen("1.txt","r",stdin);
46 //    freopen("2.txt","w",stdout);
47     #endif
48     int i,j,k;
49 //    for(scanf("%d",&cass);cass;cass--)
50 //    for(scanf("%d",&cas),cass=1;cass<=cas;cass++)
51 //    while(~scanf("%s",s+1))
52     while(~scanf("%d",&n))
53     {
54         for(i=1;i<=n;i++)
55             scanf("%d",&h[i]);
56         sort(h+1,h+1+n,cmp);
57         ans=min(n,h[n]);
58         for(i=1;i<n;i++)
59             ans=min(ans,n-i+h[i]);
60         printf("%d\n",ans);
61     }
62     return 0;
63 }
64 /*
65 //
66
67 //
68 */