#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pairi = pair<ll, ll>;
#define fi first
#define se second

const ll INF = 4e18;
const ll MOD = 1e9 + 7;
const ll base = 31;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve() {
    ll n; cin >> n;
    vector<ll> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    ll res = 0;
    for (ll x : a) if (x) res ^= x;
    cout << (res ? "First" : "Second");
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    cerr << "Program started.\n";
    auto start = chrono::steady_clock::now();
    string problem = "std";
    if (fopen((problem + ".INP").c_str(), "r")) {
        freopen((problem + ".INP").c_str(), "r", stdin);
        freopen((problem + ".OUT").c_str(), "w", stdout);
    }
    int testcase = 1; //cin >> testcase;
    while (testcase--) solve();
    auto end = chrono::steady_clock::now();
    cerr << "Program finished in " << chrono::duration_cast<chrono::milliseconds>(end - start).count() << " ms.";
}