#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N;
ll A[101010];
ll S[101010];

int win(int L,int R) {
	if(R<=L) return 0;
	if(L+1==R) return 1;
	
	ll sum=S[R]-S[L];
	int x;
	ll M=R-1;
	for(x=20;x>=0;x--) if(M-(1<<x)>=L) {
		if(A[M-(1<<x)]*(R-L)>=sum) M-=1<<x;
	}
	
	if(L==M) return 1;
	
	int a=win(L,M-1)==0;
	int b=win(M,R)==0;
	return a||b;
	
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) {
		cin>>A[i];
		S[i+1]=S[i]+A[i];
	}
	
	if(win(0,N)) cout<<"First"<<endl;
	else cout<<"Second"<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}