#include <bits/stdc++.h>
using namespace std;

#define rep(i, N) for (int i = 0; i < (N); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back

using ll = long long;
using i_i = tuple<int, int>;

bool f(int l, int r, vector<ll>& a, vector<ll>& sum) {
    int d = r - l;
    if (d == 0) return false;
    int m = lower_bound(a.begin() + l, a.begin() + r, (sum[r] - sum[l] + d - 1) / d) - a.begin();
    if (m < r && !f(l, m, a, sum)) return true;
    if (l < m && !f(m, r, a, sum)) return true;
    return false;
}

int main() {
    int N; cin >> N;
    vector<ll> a(N);
    rep(i, N) cin >> a[i];
    vector<ll> sum(N + 1);
    rep(i, N) sum[i + 1] = sum[i] + a[i];
    cout << (f(0, N, a, sum) ? "First" : "Second") << endl;
}