#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < int(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define REP_R(i, n) for (int i = int(n) - 1; (i) >= 0; -- (i))
#define REP3R(i, m, n) for (int i = int(n) - 1; (i) >= int(m); -- (i))
#define ALL(x) begin(x), end(x)
using namespace std;

int main() {
    // input
    int n; cin >> n;
    vector<int> a(n);
    REP (i, n) cin >> a[i];

    // solve
    sort(ALL(a));
    a.erase(unique(ALL(a)), a.end());
    n = a.size();
    vector<int> b;
    for (int l = 0; l < n; ) {
        int r = l + 1;
        while (r < n and a[r] == a[r - 1] + 1) {
            ++ r;
        }
        b.push_back(r - l);
        l = r;
    }
    int g = 0;
    for (int b_i : b) {
        g ^= (b_i % 2);
    }

    // output
    cout << (g ? "First" : "Second") << endl;
    return 0;
}