#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
using ll = long long;

bool f(const vector<ll> &a, const vector<ll> &tot, int l, int r){
    if(r-l <= 0) return false;
    // cerr << l << " " << r << ", ";

    ll ave = tot[r]-tot[l];
    int ac = r, wa = l-1;
    while(ac-wa > 1){
        int wj = (ac+wa)/2;
        if(ave <= a[wj]*(r-l)) ac = wj;
        else wa = wj;
    }

    if(ac == l) return true;

    if(!f(a, tot, ac, r)) return true;
    if(!f(a, tot, l, ac)) return true;
    return false;
}

int main(){
    int n; cin >> n;
    vector<ll> a(n);
    for(auto &it: a) cin >> it;

    vector<ll> tot(n+1, 0);
    for(int i = 0; i < n; i++) tot[i+1] = tot[i]+a[i];

    cout << (f(a, tot, 0, n) ? "First" : "Second") << endl;
    return 0;
}