N = int(input())
A = tuple(map(int, input().split()))
A_acc = [0] * (N + 1)
for i, a in enumerate(A):
    A_acc[i + 1] = A_acc[i] + a


def bisect_left(L, R, S):
    l, r = L - 1, R - 1
    while r - l > 1:
        m = (r + l) // 2
        if A[m] * (R - L) >= S:
            r = m
        else:
            l = m
    return r


def rec(l, r):
    # [l, r)
    if l == r:
        return False
    mean_idx = bisect_left(l, r, A_acc[r] - A_acc[l])
    if mean_idx == r:
        return False
    else:
        res = not (rec(l, mean_idx) and rec(mean_idx, r))
        return res


print("First" if rec(0, N) else "Second")