int N;
ll A[1d5],S[1d5+1];

int nib(int a,int b,ll v){
	while(a<b){
		int c=(a+b)/2;
		if(A[c]<v){
			a=c+1;
		}else{
			b=c;
		}
	}
	return a;
}

bool f(int a,int b){
	int m,c;
	ll t;
	m=b-a;
	if(m==0) return false;
	t=S[b]-S[a];
	c=nib(a,b,(t+m-1)/m);
	return a<c&&!f(c,b)||!f(a,c);
}

{
rd(N,A(N));
rep(i,N)S[i+1]=S[i]+A[i];
wt(f(0,N)?"First":"Second","");
}