let n = Scanf.scanf "%d\n" (fun x -> x)

let rec read_ints acc = function
  | 0 ->  acc
  | k -> read_ints (Scanf.scanf " %d" (fun x -> x) :: acc) (k-1)

let al = List.sort (fun x y -> compare y x) (read_ints [] n)

let parity k =
  let rec aux acc = function
    | [] -> acc
    | hd :: tl -> if hd != k then acc else aux (not acc) tl in
  aux false

let rec solve i k = function
  | [] -> true
  | hd :: tl -> if hd > i then solve (i+1) (hd - i) tl else
  k mod 2 = 1 || hd != i || parity k tl

let () = print_endline (if solve 1 0 al then "First" else "Second")