// Problem: A - Infinite Nim
// Contest: Virtual Judge - Game theory*
// URL: https://vjudge.net/contest/850173#problem/A
// Memory Limit: 512 MB
// Time Limit: 2000 ms

#include <bits/stdc++.h>
#define ll long long
#define db double
#define sti string
#define vt vector
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define pdd pair<db, db>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << '\n';
#define bit(mask, i) (((mask) >> (i)) & 1)
#define fi first
#define sc second

using namespace std;

const sti name = "";
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
const ll BASE = 311;
const int MAXN = 1e6;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

void file () {
    freopen((name + ".inp").c_str(), "r", stdin);
    freopen((name + ".out").c_str(), "w", stdout);
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    if (fopen((name + ".inp").c_str(), "r")) file();

    int n, cnt = 0, g = 0; cin >> n;
    for (int i = 1; i <= n; ++i) {
        int x; cin >> x;
        if (x == -1) cnt ^= 1;
        else g ^= x;
    }
    cout << (cnt || g ? "First" : "Second") << '\n';

    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
}