#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <iomanip>
#include <array>
#include <numeric>
#include <regex>
#include <bitset>
#include <deque>
#include <cassert>

using namespace std;
typedef long long ll;
typedef pair<int, int> p_ii;

const int INF = 1e9;
const double PI = acos(-1.0);
const ll MOD = 1e9 + 7;

#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << ": " << x << endl;
#define popcnt __builtin_popcount

int N;
vector<ll> a(100010), cum(10010, 0);

int dfs(int L, int R){ //範囲(L, R]からの勝敗
    if(L>=R) return 0;

    ll sum = cum[R]-cum[L];
    int ok = L, ng = R;//範囲(L, R]での境界
    while(ng-ok>1){
        int mid = (ok+ng)/2;
        if(a[mid]*(R-L)<sum)ok=mid;
        else ng=mid;
    }
    return !dfs(L, ok) || !dfs(ok, R);
}

int main() {
    cin>>N;
    for (int i = 1; i <= N; i++) cin>>a[i];

    for (int i = 1; i < N+1; i++) cum[i]=cum[i-1]+a[i];

    if(dfs(0, N))puts("First");
    else puts("Second");

    return 0;
}