import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [[(-1, 0), (1, 0)], [(0, -1), (0, 1)]]
inf = 10**16
md = 998244353
# md = 10**9+7

def mid(l, r):
    while l+1 < r:
        m = (l+r)//2
        if cs[r]-cs[l] <= aa[m]*(r-l): r = m
        else: l = m
    return r

def win(l, r):
    if l == r: return False
    if aa[l] == aa[r-1]: return True
    m = mid(l, r)
    if m == l: return True
    if win(l, m) == False or win(m, r) == False: return True
    return False

n = II()
aa = LI()
cs = [0]
for a in aa: cs.append(cs[-1]+a)
print("First" if win(0, n) else "Second")