package horsemeet;

import java.util.Scanner;

public class Main 
{
	static Scanner s = new Scanner(System.in);
	public static void main(String[] args) 
	{
		int pocetCisel = s.nextInt();
		int pole[] = new int[2000];
		int soucet;
		
		for(int i = 0; i < pocetCisel; i++)
		{
			pole[i] = s.nextInt();
		}
		
		{
			soucet = 0;
			for(int i = 0; i < pocetCisel; i++)
			{
				soucet += pole[i];
			}
			if(soucet % 2 == 0)
			{
				System.out.print("First");
			}
			else
				System.out.print("Second");
				
			
		}
		
	}
}
