#include <bits/stdc++.h>

#define pb push_back
#define mk make_pair
#define sc second
#define fr first

using namespace std;

typedef long long ll;

const int N = (int) 1e6 + 5;
const int mod = (int) 1e9 + 7;

int n,a[N],l = 1,t;

int main () {
        cin >> n;

        for(int i = 1; i <= n; i ++)
                cin >> a[i];

        sort(a + 1,a + n + 1, greater<int> ());

        while(a[l] >= l)
                l ++;

        l --;
        if(a[l] == l)
                t = 1;
        if((a[l] - l) % 2 == 1 || (n - l + t) % 2 == 1)
                cout << "First" << endl;
        else
                cout << "Second" << endl;
        return 0;
}
