#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define ldb long double
#define pii pair<int, int>
#define bend(v) v.begin(), v.end()
const int N = 2e5 + 5, M = 1e6 + 5;
const int mod = 1e9 + 7;
const int base = 311;
const int inf = INT_MAX;
const ll INF = LLONG_MAX;

int n, a[N], c = 0;

void solve(){

    cin>>n;
    int s = 0;
    for(int i = 1; i <= n; i++){
        cin>>a[i];
        if(a[i] == -1) c++;
        else s ^= a[i];
    }
    if(!c) cout<<(!s ? "Second" : "First");
    else cout<<(c % 2 == 1 ? "First" : "Second");
}

signed main(){
    
    if(fopen(".inp", "r")){
        freopen(".inp", "r", stdin);
        freopen(".out", "w", stdout);
    }

    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int tc = 1;
    // cin>>tc;
    while(tc--) solve();
}