#include <map>
#include <iostream>
using namespace std;

long long a[100100], s[100100];

bool check(int i, int j) {
    if (a[i] == a[j]) return true;
    long long sum = s[j+1] - s[i];
    int k = j, lb = i;
    while (k - lb > 1) {
        int m = (k + lb) / 2;
        if (a[m] * (j - i + 1) >= sum) k = m;
        else lb = m;
    }
    return !check(i, k-1) || !check(k, j);
}

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