import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


N = I()
A = LI()


def f(X):
    if len(X) == 0:
        return 0
    if len(X) == 1:
        return 1
    ave = (sum(X)+len(X)-1)//len(X)
    X0 = [x for x in X if x >= ave]
    X1 = [x for x in X if x < ave]
    if len(X0) == 0 or len(X1) == 0:
        return 1
    else:
        if f(X0) == f(X1) == 1:
            return 0
        else:
            return 1


print('First' if f(A) else 'Second')