#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}

int main(){
    ll n=1000;
    vl dp(n+1);dp[0]=0;
    for(ll i=1;i<=n;i++){
        set<ll> st;
        for(ll j=0;j<i;j++){
            ll left=max(0LL,j-1);
            ll right=max(0LL,i-j-2);
            st.insert(dp[left]^dp[right]);
        }
        rep(j,inf){
            if(!st.count(j)){
                dp[i]=j;break;
            }
        }
    }
    ll m;cin >> m;
    ll ret=0;
    ll prev=-1;
    ll ans=0;
    rep(i,m+1){
        ll x;
        if(i<m)cin >> x;
        else x=INF;
        if(x-prev==1){
            ret++;
        }
        else{
            if(ret<1000)ans^=dp[ret];
            else {
                ll to=(ret-1000)/34;
                to=ret-(to+1)*34;
                ans^=dp[to];
            }
            ret=1;
        }
        prev=x;
    }
    if(ans!=0)cout << "First" << endl;
    else cout << "Second" << endl;
}