import bisect

n = int(input())
a = list(map(int, input().split()))

b = [0] + a[:]
for i in range(n):
    b[i+1] += b[i]


def get_ave(l, r):
    return (b[r]-b[l])/(r-l)


def does_first_win(l, r):
    if l+1 == r or a[r-1] == a[l]:
        return True
    th = bisect.bisect_right(a, get_ave(l, r))
    l_hand = not does_first_win(l, th)
    r_hand = not does_first_win(th, r)
    return l_hand or r_hand


print('First' if does_first_win(0, n) else 'Second')