#include <iostream>
#include <set>
#include <vector>
using namespace std;
vector <int> moves = {2, 3, 5};
int const limit = 100;
int main () {
    vector <int> g (limit + 1);
    for (int v = 0; v <= limit; v++) {
        set <int> s;
        for (auto k : moves) if (v >= k) s.insert (g[v - k]);
        g[v] = 0; while (s.count (g[v])) g[v] += 1;
    }
    int n; cin >> n;
    vector <int> a (n);
    int total = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i]; total ^= g[a[i]];
    }
    cout << (total == 0 ? "Second" : "First") << endl;
    return 0;
}