#include <stdio.h>
#include <algorithm>
#include <functional>
using namespace std;
int a[101010];

int main(){
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++)scanf("%d",&a[i]);
	sort(a,a+n,greater<int>());
	
	for(int i=1;i<=n;i++){
		if(a[i-1]>=i && (i==n || a[i]<i+1)){
			int arm=a[i-1]-i;
			int leg=0;
			for(int j=i;j<=n;j++){if(j==n||a[j]<i){leg=j-i;break;}}
			//fprintf(stderr,"%d %d %d\n",i,arm,leg);
			if(arm%2==1||leg%2==1)puts("First"); else puts("Second");
			return 0;
		}
	}
}