#include <iostream>
#include <algorithm>
using namespace std;
int n, a[500009], g[500009];
int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i - 1];
		g[i] = (i <= 2 ? 1 : (g[i - 2] + g[i - 3] == 1 ? 2 : (g[i - 2] * g[i - 3] == 0 ? 1 : 0)));
	}
	sort(a, a + n);
	int l = 0, s = 0;
	for (int i = 1; i <= n; ++i) {
		if (i == n || a[i] - a[i - 1] >= 2) {
			s ^= g[a[i - 1] - a[l] + 1];
			l = i;
		}
	}
	cout << (s ? "First\n" : "Second\n");
	return 0;
}