#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll MAX_N = 2e5;

int main(){
    ll n;
    cin >> n;

    vector<ll> a(n);
    ll cnt = 0;
    ll x = 0;
    rep(i, n){
        cin >> a[i];
        if(a[i]==-1) cnt++;
        else x = x ^ a[i];
    }

    if(x != 0){
        cout << "First" << endl;
    }else{
        if(cnt%2 == 0) cout << "Second" << endl;
        else cout << "First" << endl;
    }
}