#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <iomanip>
using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=(b-1);i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

vector<int> uf, usz;
int nc;

void init(int n){
  vector<int> uf_(n);
  vector<int> usz_(n, 1);
  uf = uf_;
  usz = usz_;
  nc = n;

  for(int i = 0; i < uf.size(); i++){
    uf[i] = i;
  }
}

int find(int a){
  return (uf[a] == a) ? a : uf[a] = find(uf[a]);
}

void union_(int a, int b){
  a = find(a);
  b = find(b);

  if(a != b){
    if(usz[a] >= usz[b]){
      swap(a, b);
    }
    uf[a] = b;
    usz[b] += usz[a];
    nc--;
  }
}

int check(int a, int b){
  return (find(a) == find(b)) ? 1 : 0;
}

int get_size(int a){
  return usz[find(a)];
}

ll dp[100100];

int f(int n){
  if(dp[n]!=-1)return dp[n];
  if(n == 0)return 0; 
  set<int> se;
  if(n == 1)se.insert(f(n-1));
  if(n >= 2)se.insert(f(n-2));
  if(n >= 3)se.insert(f(n-3));
  if(n>=5){
  	set<pair<ll,ll> > sep;
  	rep(i,1,n){
  		ll a = i;
  		ll b = n-3-i;
  		if(b>0){
  			if(a>b)swap(a,b);
  			sep.insert(mp(a,b));
  		}
  	}
  	vector<pair<ll,ll> > vp;
  	rep(i,0,vp.sz){
  		se.insert(f(vp[i].fi)^f(vp[i].se));
  	}
  }
  int g = 0;
  while(se.count(g)!=0)g++;
  return dp[n] = g;
}

int main(void) {
	clr(dp,-1);
	ll n;
	cin>>n;
	set<ll> se;
	rep(i,0,n){
		ll a;
		cin>>a;
		se.insert(a);
	}
	vector<ll> v(all(se));
	init(v.sz);
	rep(i,0,v.sz-1){
		if(v[i]==v[i+1]-1){
			union_(i,i+1);
		}
	}
	set<ll> se1;
	rep(i,0,v.sz){
		se1.insert(find(i));
	}
	vector<ll> v1(all(se1));
	vector<ll> v2;
	rep(i,0,v1.sz){
		v2.pb(get_size(v1[i]));
	}
	ll ans = 0;
	rep(i,0,v2.sz){
		ans ^=f(v2[i]);
	}
	if(ans!=0){
		cout << "First" << endl;
	}
	else{
		cout << "Second" << endl;
	}
	return 0;
}