import std.stdio, std.conv, std.string, std.bigint;
import std.math, std.random, std.datetime;
import std.array, std.range, std.algorithm, std.container, std.format;
string read(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }

int n;
long[] as;
long[] sums; // sums[i] は as[i -1] までの和
void main(){
	n = read.to!int;
	as = readln.chomp.split.map!(to!long).array;
	
	sums = [0];
	foreach(a; as) sums ~= sums[$ - 1] + a;
	
	solve(0, n - 1).writeln;
}

string solve(int l, int r){ // [l, r]
	int c = uplimit(l, r, (int i) => as[i] * (r + 1 - l) < sums[r + 1] - sums[l]);
	if(c < l) return "First";
	else if(solve(l, c) == "Second") return "First";
	else if(solve(c + 1, r) == "Second") return "First";
	else return "Second";
}

// fをみたす最大
int uplimit(int a, int c, bool delegate(int) f){
	if(f(c)) return c;
	if(! f(a)) return a - 1;
	while(a + 1 < c){
		int b = (a + c) / 2;
		if(f(b)) a = b;
		else c = b;
	}
	return a;
}