#include <iostream>
#include <algorithm>
#include <vector>
#include <set>

using namespace std;

int g[500001];

int main() {
  g[1] = 1;
  g[2] = 1;
  for (int i = 3; i <= 500000; i++) {
    long long st = 0;
    st |= 1LL << g[i - 2];
    for (int j = 0; j <= min(800, i - 3); j++) {
      st |= 1LL << (g[j] ^ g[i - 3 - j]);
    }
    while (st >> g[i] & 1) {
      g[i]++;
    }
  }
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  int cnt = 1;
  int ans = 0;
  for (int i = 1; i < n; i++) {
    if (a[i - 1] + 1 == a[i]) {
      cnt++;
    } else {
      ans ^= g[cnt];
      cnt = 1;
    }
  }
  ans ^= g[cnt];
  cout << (ans != 0 ? "First" : "Second") << endl;
}