#!python
# -*- coding: utf-8 -*-


# sはunique sortしろ
def dfs(p, s):
    if s == []:
        return (not p)

    for i in range(len(s)):
        new_s = s.copy()
        if i != len(s) - 1:
            if s[i + 1] - s[i] <= 1:
                del new_s[i + 1]
        del new_s[i]
        if i != 0:
            if s[i] - s[i - 1] <= 1:
                del new_s[i - 1]
        if dfs((not p), new_s) == p:
            return p
    return (not p)


def main():
    N = int(input())
    A = list((map(int, input().split())))
    A.sort()
    if dfs(True, A):
        print('First')
    else:
        print('Second')


if __name__ == '__main__':
    main()