import sys
sys.setrecursionlimit(10**7)

def BinarySearch(yes, no):
    L, R = yes, no
    while abs(yes - no) != 1:
        mid = (yes + no)//2
        if A[mid] * (R - L) < Ac[R] - Ac[L]:
            yes = mid
        else:
            no = mid
    return yes

N = int(input())
A = sorted(list(map(int, input().split())))
Ac = [0] * (N + 1)
for i in range(N):
    Ac[i + 1] = Ac[i] + A[i]

def dfs(L, R):
    if R <= L:
        return 0
    if A[L] == A[R - 1]:
        return 1
    ind = BinarySearch(L, R)
    return dfs(L, ind + 1) == 0 or dfs(ind + 1, R) == 0
    
print("First") if dfs(0, N) else print("Second")