// I SELL YOU...! 
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define FI "First"
#define SE "Second"
void init_io(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(10);
}
signed main(){
  init_io();
  ll n,sum=0,min_a=10000000000000;
  string ans;
  cin >> n;
  vector<ll> a(n);
  for(int i=0;i<n;i++){
    cin >> a[i];
    sum += a[i];
    min_a = min(min_a,a[i]);
  }
  if(n%2==1){
    if(sum%2!=0){
      ans = FI;
    }else{
      ans = SE;
    }
  }else{
    if(sum%2==1){
      ans = FI;
    }else{
      if(min_a%2==1){
        ans = FI;
      }else{
        ans = SE;
      }
    }
  }
  cout << ans << endl;
}

