#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;
set<int> S;
vector<int> V;

int gr[505050];

int hoge2(int v) {
	int V[10]={0,1,1,0,2,1,3,0,1,3};
	vector<int> W={4,2,3,0,2,5,3,2,5,0,4,1,3,4,1,5,3,2,5,0,
	               4,2,3,4,1,5,3,2,5,0,4,1,3,4,1,5,3,2,5,0,
                   4,2,3,4,1,5,3,2,5,0,4,1,3,4,1,5,3,2,5,0,
                   4,2,3,4,1,5,3,2,5,0,4,1,3,4,1,5,3,2,5,0,
               };

	if(v<10) return V[v];
	if(v<20) return W[v%10];
	if(v==21) return 1;
	else return W[v%10+20];
	
	/*
	if(v==0) return 0;
	if(v<=2) return 1;
	v-=3;
	v%=18;
	if(v<9) {
		return v!=4;
	}
	else {
		return 1+(v!=13);
	}
	*/
}

int hoge(int v) {
	if(gr[v]>=0) return gr[v];
	
	if(v==0) return 0;
	if(v<=2) return 1;
	set<int> S;
	for(int i=1;i<=min(100,v);i++) {
		int L=max(0,i-2);
		int R=max(0,v-(i+1));
		S.insert(hoge(L)^hoge(R));
	}
	gr[v]=0;
	while(S.count(gr[v])) gr[v]++;
	return gr[v];
	
}


void solve() {
	int i,j,k,l,r,x,y; string s;
	
	MINUS(gr);
	cin>>N;
	FOR(i,N) cin>>x, S.insert(x);
	
	int pre=-1,first;
	FORR(s,S) {
		if(pre==-1) {
			first=pre=s;
		}
		if(s>pre+1) {
			V.push_back(pre-first+1);
			first=s;
		}
		pre=s;
	}
	V.push_back(pre-first+1);
	int nim=0;
	FORR(v,V) nim^=hoge(v);
	
	
	
	if(nim==0) cout<<"Second"<<endl;
	else cout<<"First"<<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;
}