#include <cstdio>
#include <algorithm>
using namespace std;

typedef long long ll;
int n;
ll vs[10005];

int main() {
	scanf("%d",&n);
	for (int i=0;i<n;++i) scanf("%lld",vs+i);
	sort(vs,vs+n);

	ll prev=0;
	for (int i=0;i<n;++i) {
		if (prev+1<vs[i]) break;
		else prev+=vs[i];
	}
	printf("%lld\n",prev+1);
}