// Candy Piles
// * frank_c1
// * 2017 / 09 / 29
 
 #include <bits/stdc++.h>
using namespace std;

const int maxn = (int)(1e5) + 5;
int a[maxn];

int main() {
	int n; scanf("%d", &n);
	for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
	sort(a + 1, a + n + 1, greater<int>()); 
	int pt = 0; for (; pt < n && pt < a[pt + 1]; ++pt);
	int ps = pt; for (; ps < n && a[ps + 1] == pt; ++ps); 
	if (!(((a[pt] - pt + 1) & 1) && ((ps - pt + 1) & 1))) printf("First\n"); else printf("Second\n");
	return 0;
}