#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
int a[N];
bool cmp(int x,int y)
{
	return x>=y;
}
template <class T>
inline void read(T &x) {
    x = 0;
    char c = getchar();
    bool f = 0;
    for (; !isdigit(c); c = getchar()) f ^= c == '-';
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    x = f ? -x : x;
}
int main() {
	int n;
	read(n);
	for(int i=1;i<=n;i++)
		read(a[i]);
	sort(a+1,a+1+n,cmp);
	//准找最大的正方形
	int r=1;
	while(a[r+1]>=r+1)
		++r;
	//这个点上方的状态
	int mix1=a[r]-r,mix2;
	int p=r;
	while(a[p+1]==r) ++p;
	mix2=p-r;
	if(mix1%2==1 || mix2%2==1) printf("First");
	else printf("Second");
	return 0;
}

第七个点TLE