#include <stdio.h>
#include <algorithm>
#include <map>
using namespace std;

map<pair<int, int>, bool> chk;
long long A[100100],S[100100]; int N;

bool go(int i, int j)
{
	if (i > j) return false;
	if (i == j) return true;
	if (chk.count({i,j})) return chk[{i,j}];
	bool &r = chk[{i,j}];

	long long u = (S[j] - S[i-1]) / (j - i + 1);
	long long v = (S[j] - S[i-1] + j - i) / (j - i + 1);
	int p = upper_bound(A, A+N, u) - A;
	int q = lower_bound(A, A+N, v) - A - 1;
	if (!go(p, j) || !go(i, q)) r = true;
	else r = false;

	return r;
}

int main()
{
	scanf ("%d",&N);
	for (int i=1;i<=N;i++){
		scanf ("%lld",&A[i]);
		S[i] = S[i-1] + A[i];
	}

	puts(go(1,N)?"First":"Second");

	return 0;
}