#include <stdio.h>
#include <algorithm>
#include <set>
using namespace std;

int main()
{
	int A[170];
	A[0] = 0; A[1] = 1; A[2] = 1;
	for (int i=3;i<170;i++){
		set<int> k;
		k.insert(A[i-2]);
		k.insert(A[i-3]);
		for (int a=0;a<=i-3;a++){
			int x = A[a] ^ A[i-3-a];
			k.insert(x);
		}
		for (int j=0;;j++) if (!k.count(j)){
			A[i] = j; break;
		}
	}

	int N,V[500500];
	scanf ("%d",&N);
	for (int i=0;i<N;i++) scanf ("%d",&V[i]);
	sort(V,V+N);

	int l = 0, x = 0;
	for (int i=0;i<N;i++){
		if (i && V[i-1] + 1 == V[i]) x ^= A[l++];
		else l = 1;
		x ^= A[l];
	}
	
	puts(x?"First":"Second");

	return 0;
}