Codeforces Round #358 (Div. 2) B

B. Alyona and Mex

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Someone gave Alyona an array containing n positive integers a1, a2, ..., an. In one operation, Alyona can choose any element of the array and decrease it, i.e. replace with any positive integer that is smaller than the current one. Alyona can repeat this operation as many times as she wants. In particular, she may not apply any operation to the array at all.

Formally, after applying some operations Alyona will get an array of n positive integers b1, b2, ..., bn such that 1 ≤ bi ≤ ai for every1 ≤ i ≤ n. Your task is to determine the maximum possible value of mex of this array.

Mex of an array in this problem is the minimum positive integer that doesn't appear in this array. For example, mex of the array containing 1, 3 and 4 is equal to 2, while mex of the array containing 2, 3 and 2 is equal to 1.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the number of elements in the Alyona's array.

The second line of the input contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109) — the elements of the array.

Output

Print one positive integer — the maximum possible value of mex of the array after Alyona applies some (possibly none) operations.

Examples

input

5
1 3 3 3 6

output

5

input

2
2 1

output

3

Note

In the first sample case if one will decrease the second element value to 2 and the fifth element value to 4 then the mex value of resulting array 1 2 3 3 4 will be equal to 5.

To reach the answer to the second sample case one must not decrease any of the array elements.

把所有数离散一下

显然想要答案为k，那么就要凑齐[1,k-1]所有数，

显然，越小的数越优先拿来凑越优

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;

const int maxn = 1E5 + 10;

int n,cur,a[maxn],b[maxn],c[maxn];

int main()
{
	#ifdef YZY
		   freopen("yzy.txt","r",stdin);
	#endif
	
	cin >> n;
	for (int i = 1; i <= n; i++) scanf("%d",&a[i]),b[i] = a[i];
	sort(a + 1,a + n + 1);
	for (int i = 1; i <= n; i++)
		if (a[i] != a[i-1])
			a[++cur] = a[i];
	for (int i = 1; i <= n; i++) {
		int po = lower_bound(a + 1,a + cur + 1,b[i]) - a;
		++c[po];
	}
	int pos = 1;
	for (int i = 1; i <= maxn; i++) {
		while (!c[pos] || a[pos] < i) {++pos; if (pos > cur) {cout << i; return 0;}}
		--c[pos];
	}
	return 0;
}