from math import sqrt,sin,cos,tan,ceil,radians,floor,gcd,exp,log,log10,log2,factorial,fsum
from heapq import heapify, heappop, heappush
from bisect import bisect_left, bisect_right
from copy import deepcopy
import copy
import random
from random import randrange
from collections import deque,Counter,defaultdict
from itertools import permutations,combinations
from decimal import Decimal,ROUND_HALF_UP
#tmp = Decimal(mid).quantize(Decimal('0'), rounding=ROUND_HALF_UP)
from functools import lru_cache, reduce
#@lru_cache(maxsize=None)
from operator import add,sub,mul,xor,and_,or_,itemgetter
import sys
input = sys.stdin.readline
# .rstrip()
INF = 10**18
mod1 = 10**9+7
mod2 = 998244353

#DecimalならPython
#再帰ならPython!!!!!!!!!!!!!!!!!!!!!!!!!!


'''
nimじゃん
開ける前に取り出すことはできないから、nimじゃないのか?
真似っこできるから、そっち方面で考えてみる
開けたら取り出す、をしてたら後手必勝じゃないか
逆に0の数を数えればよくて
0が偶数個なら、後手
'''

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

z = 0
for i in range(N):
    if A[i] == 0:
        z += 1

if z%2 == 0:
    print('Second')
else:
    print('First')