#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<bitset>
#include<stack>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
/*
cout<<setprecision(20)
cin.tie(0);
ios::sync_with_stdio(false);
*/
const llint mod=1e9+7;
const llint big=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
//llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
int main(void){
	int n,i,j,k,ans=0;cin>>n;
	vector<int>gru(133);gru[1]=1;
	for(i=2;i<=34*3;i++){
		set<int>aaa;
		if(i>=2){aaa.ins(gru[i-2]);}
		for(j=0;j<=(i-3)/2;j++){aaa.ins(gru[j]^gru[i-3-j]);}
		while(aaa.count(gru[i])){gru[i]++;}
	}
	vector<int>S(n+1);
	for(i=0;i<n;i++){cin>>S[i];}
	S[n]=mod;
	SO(S);
	int rtu=0;
	for(i=0;i<n;i++){
		rtu++;
		if(S[i]+1<S[i+1]){if(rtu>68){rtu=68+rtu%34;}ans^=gru[rtu];rtu=0;}
	}
	cout<<(ans?"First":"Second")<<endl;
	return 0;
}