import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N;
int[] A;

void main() {
  enum LIM = 52 + 34;
  auto dp = new int[LIM];
  foreach (n; 1 .. LIM) {
    auto app = new int[LIM];
    foreach (i; 0 .. n) {
      app[dp[max(i - 1, 0)] ^ dp[max(n - i - 2, 0)]] = true;
    }
    dp[n] = cast(int)(app.minIndex);
  }
  debug {
    writeln(dp);
  }
  
  int f(int n) {
    return dp[(n < 52) ? n : (52 + (n - 52) % 34)];
  }
  
  try {
    for (; ; ) {
      N = readInt();
      A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt();
      }
      A.sort;
      int ans;
      for (int i = 0, j = 0; i < N; i = j) {
        for (; j < N && A[i] - i == A[j] - j; ++j) {}
        ans ^= f(j - i);
      }
      writeln(ans ? "First" : "Second");
    }
  } catch (EOFException e) {
  }
}