#include <iostream>
#include <algorithm>

using namespace std;

int n;

int a[110000], ans;

int main()
{
	freopen("destruction.in", "r", stdin);   
	freopen("destruction.out", "w", stdout);

	scanf("%d", &n);
	for(int i = 0; i < n; i++)
	{
		scanf("%d", &a[i]);	
	}
	sort(a, a + n, greater<int>());
	for(int i = 0; i < n; i++)ans = max(ans, a[i] + i);
	cout << ans << endl;  
	return 0;
}

/*


*/