import sys,random,bisect
from collections import deque,defaultdict,Counter
from heapq import heapify,heappop,heappush
from itertools import cycle, permutations
from math import log,gcd

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

N = int(input())
A = li()

G = 0
T = 0
for a in A:
    if a==-1:
        T += 1
    else:
        G ^= a

if G == 0 and T&1 == 0:
    print("Second")
else:
    print("First")