#include <bits/stdc++.h>

using namespace std;

using ll = long long;

bool solve(int L, int R, vector<ll>& a, vector<ll>& sum) {
    int m = R - L;
    if (m == 0) return false;
    if (m == 1) return true;
    //if (m == 2) return false;
    //if (m == 3) return true;

    ll s = sum[R] - sum[L];
    int ng = L - 1, ok = R - 1;
    while (ok - ng > 1) {
        int mid = (ok + ng) / 2;
        if (a[mid] * m >= s) ok = mid;
        else ng = mid;
    }
    if (ok == L) return true;
    return !solve(L, ok, a, sum) || !solve(ok, R, a, sum);
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<ll> a(n), sum(n + 1, 0);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        sum[i + 1] = sum[i] + a[i];
    }
    cout << (solve(0, n, a, sum) ? "First" : "Second") << endl;
    return 0;
}