#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

int N;
ll A[100005], S[100005];

map<pair<int, int>, bool> mem;

bool f(int l, int r) {
    if (l == r)RT false;
    auto lr = mp(l, r);
    if (mem.count(lr))RT mem[lr];
    auto &re = mem[lr];

    int n = r - l;
    ll med = (S[r] - S[l] + n - 1) / n;
    int t = lower_bound(A + l, A + r, med) - A;
    // [l, t) [t, r)
    if ((r != t && f(l, t)) && (l != t && f(t, r)))re = false;
    else re = true;
    RT re;
}

void solve() {
    cin >> N;
    rep(i, N) {
        cin >> A[i];
        S[i + 1] = A[i] + S[i];
    }
    bool ans = f(0, N);
    cout << (ans ? "First" : "Second") << endl;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}