#include using namespace std; const int MAXN = 2000; int sg[MAXN]; int dfs(int x) { if (x < 0) return 0; if (~sg[x]) return sg[x]; set bag; if (x == 1) bag.emplace(dfs(x - 1)); else bag.emplace(dfs(x - 2)); for (int i = 1; i + 1 < x; ++i) bag.emplace(dfs(i - 1) ^ dfs(x - (i + 1) - 1)); for (int i = 0; ; ++i) if (!bag.count(i)) return sg[x] = i; } signed main() { memset(sg, 0xff, sizeof(sg)); sg[0] = 0; auto get_sg = [&](int n) { if (n < 1000) return dfs(n); int t = n - 1000; return dfs(1000 + t % 34); }; ios::sync_with_stdio(false); int N; cin >> N; vector A(N); for (int i = 0; i < N; ++i) cin >> A[i]; sort(A.begin(), A.end()); int ans = 0; for (int i = 0; i < N; ++i) { int j = i + 1; while (j < N && A[j] == A[j - 1] + 1) ++j; ans ^= get_sg(j - i); i = j - 1; } cout << (ans == 0 ? "Second" : "First") << endl; }