#include <iostream>

using namespace std;
using ll = long long;

ll A[100010], sum[100010];

// (b, e]で回ってきたときに勝てるか？
bool sim(int b, int e) {
    int l = e - b;
    ll s = sum[e] - sum[b];
    if (l == 0) return false;

    int ok = b, ng = e;
    // A[ok] < ave

    while (ng - ok > 1) {
        int mid = (ok + ng) / 2;
        if (A[mid] * l < s) {
            ok = mid;
        } else {
            ng = mid;
        }
    }

    // (b, ok]と(ok, ng]に分かれる
    return !sim(b, ok) || !sim(ok, e);
}

int main() {
    int N;
    cin >> N;

    for (int i = 1; i <= N; ++i) {
        cin >> A[i];
        sum[i] = sum[i - 1] + A[i];
    }

    cout << (sim(0, N) ? "First" : "Second") << endl;
    return 0;
}