from bisect import bisect_left
def f(L,R):
    if L+1==R:
        return 1
    elif L+2==R:
        return int(a[L]==a[L+1])
    s = acc[R] - acc[L]
    i = bisect_left(a,(s+R-L-1)//(R-L))
    v = 0
    if L < i and f(L,i)==0: v = 1
    if i < R and f(i,R)==0: v = 1
    return v

n = int(input())
*a, = map(int,input().split())
acc = [0]+a[:]
for i in range(1,n+1):
    acc[i] += acc[i-1]
print("First" if f(0,n) else "Second")