#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

fn main() {
    let n: usize = read();
    let mut a: Vec<u64> = read_vec();
    a.sort();
    let mut mountains = Vec::new();
    mountains.push(1);
    for i in 1..n {
        if a[i] == a[i - 1] + 1 {
            let last_elem = mountains.len() - 1;
            mountains[last_elem] += 1;
        } else {
            mountains.push(1);
        }
    }

    let mem = vec![
        0, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 0, 5, 2, 2, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4,
        5, 2, 7, 4, 0, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 2, 3, 3, 0, 1, 1, 3, 0, 2,
    ];

    let mem_cycle = vec![
        1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1,
        1, 3, 0, 2,
    ];
    let grundy = |i| {
        if i < mem.len() {
            mem[i]
        } else {
            mem_cycle[(i - mem.len()) % mem_cycle.len()]
        }
    };

    let result = mountains.iter().fold(0, |s, &x| s ^ grundy(x));
    if result == 0 {
        println!("Second");
    } else {
        println!("First");
    }
}