#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(v) begin(v), end(v)
#define pll pair<ll, ll>
#define fi first
#define se second
#define vll vector<ll>
#define mll map<ll, ll>
#define endl '\n'
mt19937_64 rng(chrono::high_resolution_clock().now().time_since_epoch().count());
const ll N = 2e5 + 6, inf = 1e18 + 7, mod = 1e9 + 7;
ll n, m, k, q, ans = 0, a[N];

void solve() {
	cin >> n;
	ll sum = 0, cnt = 0;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
		if (a[i] != -1) sum ^= a[i];
		else ++cnt;
	}
	if (cnt % 2 == 1) cout << "First";
	else if (cnt == 0) {
		cout << (sum ? "First" : "Second");
	} else {
		cout << "Second";
	}
	return;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	if (fopen(".inp", "r")) {
		freopen(".inp", "r", stdin);
		freopen(".out", "w", stdout);
	}
	ll tc = 1;
	//cin >> tc;
	while (tc--) {
		solve();
	}
	return 0;
}