#include <bits/stdc++.h>
using namespace std;

vector<int> num_split(const vector<int> & As){
    vector<int> result = {};
    int length = 1;
    for (int i = 1; i < As.size(); ++i){
        if (As[i] == As[i - 1] + 1){
            ++length;
        }else{
            result.push_back(length);
            length = 1;
        }
    }
    result.push_back(length);
    return result;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    vector<int> g = {0, 3, 1, 2};
    int N;
    cin >> N;
    vector<int> As(N);
    for (auto & a : As) cin >> a;
    sort(As.begin(), As.end());
    auto chunks = num_split(As);

    int grundy = 0;
    for (auto & m : chunks){
        if (m == 1){
            grundy ^= 1;
        }else{
            grundy ^= g[m % 4];
        }
    }
    if (grundy == 0){
        cout << "Second" << endl;
    }else{
        cout << "First" << endl;
    }
    return 0;
}