#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }


int main() {
  ll N; cin >> N;
  ll A[N]; rep(i,N) cin >> A[i]; sort(A,A+N);
  vector<ll> nums; ll now = 1;
  repr(i,1,N) {
    if (A[i]-A[i-1]==1) now++;
    else { nums.push_back(now); now = 1; }
  }
  nums.push_back(now);
  // debug(all(nums));

  ll g1[34] = {0, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 0, 5, 2, 2, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 2, 7, 4};
  ll g2[34] = {0, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 2, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4};
  ll grundy[34] = { 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4};
  ll xr = 0; for (auto x: nums) xr ^= x<34 ? g1[x] : x<68 ? g2[x%34] : grundy[x%34];
  string result = xr ? "First" : "Second";
  cout << result << endl;

  // ll grundy[200] = {};
  // repr(i,1,200) {
  //   ll arr[200] = {};
  //   arr[grundy[max(0ll,i-2ll)]]++;
  //   arr[grundy[max(0ll,i-3ll)]]++;
  //   rep(j,i-4) {
  //     ll num = grundy[j+1] ^ grundy[i-(j+4)];
  //     arr[num]++;
  //   }
  //   ll res = 0; while (arr[res]) res++;
  //   grundy[i] = res;
  // }
  // rep(i,5) debug(grundy+i*34, grundy+(i+1)*34);

  return 0;
}