#include <cstdio>
#include <algorithm>
#include <functional>

const int N = 100000 + 10;

int n, a[N];

int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  std::sort(a + 1, a + n + 1, std::greater<int>());
  int x = 1;
  while (x <= n && a[x + 1] >= x + 1) ++x;
  int u = a[x] - x, v = 0;
  for (int i = x + 1; i <= n; ++i) if (a[i] >= x) ++v; else break;
  puts((u & 1) || (v & 1) ? "First" : "Second");
  return 0;
}
