#include <bits/stdc++.h>
using namespace std;
const int Maxn = 1111111;
int n, a[Maxn];
int main() {
  scanf("%d", &n);
  int sum = 0;
  bool appear1 = false;
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
    sum += a[i] & 1;
    appear1 |= a[i] & 1;
  }
  if (sum & 1) {
    puts("First");
  } else {
    if (appear1) {
      puts("First");
    } else {
      puts("Second");
    }
  }
  return 0;
}
