#!/usr/bin/ python3.8
# %%
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 5)
import itertools
from bisect import bisect_left

N = int(readline())
A = tuple(map(int, read().split()))
Acum = (0,) + tuple(itertools.accumulate(A))


def solve(L, R):
    """result on interval [L,R)"""
    S = Acum[R] - Acum[L]
    n = R - L
    x = (S + n - 1) // n
    i = bisect_left(A, x, lo=L, hi=R)
    if i == L:
        return True
    if not solve(L, i):
        return True
    return not solve(i, R)

print('First' if solve(0,N) else 'Second')