#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <memory.h>

using namespace std;

int n, ar[1000001];

int main()
{
    cin >> n;
    for(int i = 1; i <= n; i++)
        scanf("%d", &ar[i]);

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

    int a = 1, b = 1;
    while(ar[b] >= a)
    {
        b++;
        a++;
    }
    b--;
    a--;

    int t1 = 1, t2 = 1;

    if((ar[b] - a) % 2 == 1)
        t1 = 0;

    int q = 0;
    for(int i = 1; i <= n; i++)
        if(ar[i] >= a)
            q++;

    if((q - a) % 2 == 1)
        t2 = 0;

    if(t2 + t1 != 2)
    {
        cout << "First" << endl;
    }else
    {
        cout << "Second" << endl;
    }
    return 0;
}
