#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << (x) << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
using ll = long long;
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
int N;
V<ll> a;
bool Awin(int l,int r){
	if(l==r) return false;
	ll n = r-l;
	ll sm = 0;
	for(int i=l;i<r;i++) sm += a[i];
	int m = l-1;
	for(int i=l;i<r;i++){
		if(a[i]*n<sm) m = i;
	}
	bool can = false;
	if(m!=l-1){
		can |= !Awin(m+1,r);
	}
	can |= !Awin(l,m+1);
	return can;
}
int main(){
	cin>>N;
	a.resize(N);
	rep(i,N) cin>>a[i];
	if(Awin(0,N)) puts("First");
	else puts("Second");
}