#include<bits/stdc++.h>
#define MAX_N 100001
#define INF_INT 2147483647
#define INF_LL 9223372036854775807
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
void init(int n);
int find(int n);
void unite(int x,int y);
bool same(int x, int y);
ll bpow(ll,ll,ll);
typedef vector<int> vec;
typedef vector<vec> mat;
mat mul(mat &A,mat &B);
mat pow(mat A,ll n);
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};
const int MOD = 1000000007;

bool cmp_P(const P &a,const P &b){
  return a.second < b.second;
}
int main()
{
  int N,A[500001],grundy[500001],grunm[40];
  cin >> N;
  REP(i,N)
    scanf("%d",&A[i]);
  grundy[0] = 0;
  grundy[1] = 1;
  for(int i=2;i<=1000;i++){
    set<int> vec;
    vec.insert(grundy[i-2]);
    for(int k=0;k<=i-3;k++){
      vec.insert(grundy[k] ^ grundy[i-k-3]);
    }
    REP(j,500001){
      if(vec.count(j) == 0){
        grundy[i] = j;
        break;
      }
    }
  }
  REP(i,34){
    grunm[i] = grundy[340+i];
  }
  vector<int> tower(0);
  sort(A,A+N);
  int cnt=1;
  REP(i,N-1){
    if(A[i] +1 == A[i+1]){
      cnt++;
    }else{
      tower.push_back(cnt);
      cnt = 1;
    }
  }
  tower.push_back(cnt);
  int ff=0;
  REP(i,tower.size())ff+=tower[i];
  
  int x=0;
  REP(i,tower.size()){
    if(tower[i] <= 1000)
      x ^= grundy[tower[i]];
    else
      x ^= grunm[tower[i]%34];
  }
  if(x == 0){
    cout << "Second" << endl;
  }else
    cout << "First" << endl;
  return 0;
}