#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) { return (ull)rng() % B; }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    int pre = 0;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        int b;
        cin >> b;
        a[i] = b - pre;
        pre = b;
    }
    reverse(a.begin(), a.end());
    int g = 0;
    for (int i = 0; i < n; i += 2) {
        g ^= a[i];
    }
    if (g) cout << "First" << endl;
    else cout << "Second" << endl;
}