#include <bits/stdc++.h>

using namespace std;

const int N=1e5+10;

int n,a[N];

void Init()
{
	scanf("%d",&n);
	for (int i=1;i<=n;++i) scanf("%d",&a[i]);
}

void Solve()
{
	sort(a+1,a+n+1);
	reverse(a+1,a+n+1);
	for (int i=1;i<=n;++i)
		if (a[i+1]<i+1)
		{
			int ret=1;
			for (int j=i+1;j<=n && a[j]==i;++j) ret=ret^1;
			ret&=(a[i]-(i-1))&1;
			if (ret) printf("Second\n");
			else printf("First\n");
			break; 
		}
}

int main()
{
	Init();
	Solve();
	return 0;
}