#include <bits/stdc++.h>

#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) for(int i=m;i<n;i++)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define debug(x) cerr << #x << ": " << x << endl

using namespace std;

typedef long long ll;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pii;

const ll MOD = 1000000007;
const long double EPS = 10e-10;

int main(){
    std::ios::sync_with_stdio(0); cin.tie(0);
    int n;
    cin >> n;
    int a[n];
    rep(n) cin >> a[i];
    sort(a, a+n);
    int groups = 0, i = 1, start = 0;
    while(i < n){
        if(a[i] - a[i-1] > 1){
            groups += (i-1 - start + 1) % 2;
            start = i;
        }
        i++;
    }
    if(start != n) groups += (n-1 - start + 1) % 2;
    cout << (groups%2?"First":"Second") << endl;
}