import sys
input = sys.stdin.readline

from bisect import bisect,bisect_left

N=int(input())
A=list(map(int,input().split()))

S=[0]
for a in A:
    S.append(S[-1]+a)

def calc(l,r,te):
    if r-l+1==1:
        return te
    
    SUM=S[r+1]-S[l]
    ko=r-l+1
    k=bisect_left(A,SUM/ko)

    if k==l:
        return te
    
    if calc(l,k-1,te^1)==te or calc(k,r,te^1)==te:
        return te
    else:
        return te^1

ANS=calc(0,N-1,0)

if ANS==0:
    print("First")
else:
    print("Second")