#include <iostream>

using namespace std;

int n;
long long a[100000];
long long s[100001];

bool f(int l, int r) {
    if (r - l == 0) return false;
    int k = lower_bound(a + l, a + r, (s[r] - s[l] + r - l - 1) / (r - l)) - a;
    if (l == k || r == k) return true;
    return !f(l, k) || !f(k, r);
}

int main() {
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        s[i + 1] = s[i] + a[i];
    }
    cout << (f(0, n) ? "First" : "Second") << endl;
}