#include<iostream>
#include<set>
#include<algorithm>
using namespace std;
int N;
int A[5<<17];
int memo[5<<17];
bool vis[5<<17];
int gru(int X)
{
	if(vis[X])return memo[X];
	set<int>S;
	for(int i=3;i<=X;i++)
	{
		S.insert(gru(i-3)^gru(X-i));
	}
	int id=0;
	while(S.find(id)!=S.end())id++;
	vis[X]=true;
	return memo[X]=id;
}
main()
{
	cin>>N;
	for(int i=0;i<N;i++)cin>>A[i];
	sort(A,A+N);
	vis[0]=true;
	vis[1]=true;memo[1]=1;
	vis[2]=true;memo[1]=1;
	int ans=0;
	int c=1,pre=A[0];
	for(int i=1;i<N;i++)
	{
		if(pre+1<A[i])
		{
			ans^=gru(c);
			c=1;
		}
		else c++;
		pre=A[i];
	}
	ans^=gru(c);
	cout<<(ans?"First":"Second")<<endl;
}