#include <bits/stdc++.h>

using namespace std;


#define MP make_pair
#define ff first
#define ss second


long long prv=1000000007;
#define ll long long

int main() {

    int n,k;

    cin>>n;

    vector<int>V(10000,0);

    for(int i=2; i<=3000; i++){
        int max_cislo = 0;
        for(int j=1; j<i; j++){
            int pocet_kopok = i/j;
            int posledna_kopka = i%j;

            

            if(pocet_kopok%2==0 && posledna_kopka==0){
                max_cislo = 1;
            }
            else{
                if(pocet_kopok%2==0)
                   pocet_kopok = 0;
                else
                    pocet_kopok = j;
                max_cislo = max(max_cislo, (V[posledna_kopka]^V[pocet_kopok])+1);
            }
        }
        V[i] = max_cislo;


    }

    int res = 0;
    for(int i=0; i<n; i++){
        int x;
        cin>>x;
        res^=V[x];
    }
    if(res==0)
        cout<<"Second"<<endl;
    else
        cout<<"First"<<endl;


}