#include <bits/stdc++.h>
using namespace std;

using ll=long long;
using ld=long double;
#define FOR(i, a,b) for(ll i=a;i<(ll)b; i++)
#define F(N) FOR(i, 0, N)
#define FF(N) FOR(j, 0, N)
#define aa first
#define bb second
#define PB push_back

int mex[2012];

int main() {
  F(2002) {
    set<int> turns;
    FOR(k, 1, i) {
      int tmex = 0;
      if ((i / k) % 2) {
        tmex = mex[k];
      }
      tmex ^= mex[i % k];
      turns.insert(tmex);
    }
    FOR(k, 0, i) {
      if (!turns.count(k)) {
        mex[i] = k;
        break;
      }
    }
  }
  int n; cin >> n;
  int xr = 0;
  F(n) {
    int x; cin >> x;
    xr ^= mex[x];
  }
  if (xr) {
    cout << "First" << endl;
  } else {
    cout << "Second" << endl;
  }
  return 0;
}