from collections import defaultdict 
import sys,heapq,bisect,math,itertools,string

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

aa.sort()

li = []
num = 1
for i in range(N-1):
	if aa[i+1]-aa[i] == 1:
		num += 1
	else:
		li.append(num)
		num = 1
li.append(num)		
ans = 0		
while 4 in li:
	li.remove(4)

while 1 in li:
	ans += 1
	li.remove(1)

while 2 in li:
	ans += 1
	li.remove(2)
	
for i in li:
	if i < 8 or i%2 == 1:
		print('First')
		sys.exit()

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