#include <bits/stdc++.h>
using namespace std;

signed main() {
  ios::sync_with_stdio(false);

  int N;
  cin >> N;

  vector<int64_t> A(N);
  for (int i = 0; i < N; ++i) cin >> A[i];

  vector<int64_t> asum(N + 1);
  partial_sum(A.begin(), A.end(), asum.begin() + 1);

  function<int(int, int)> solve = [&](int lb, int rb) {
    if (lb == rb) return 1; // second wins
    if (A[lb] == A[rb - 1]) return 0;
    int a = lb, b = rb;
    while (b - a > 1) {
      int c = a + b >> 1;
      (A[c] * (rb - lb) < asum[rb] - asum[lb] ? a : b) = c;
    }
    return !solve(lb, a + 1) & !solve(a + 1, rb);
  };

  cout << vector<string>({"First", "Second"})[solve(0, N)] << endl;

  return 0;
}