#include <bits/stdc++.h>

using namespace std;

bool dfs(int l, int r, const vector<long long> &a) {
  if (r - l < 1) return false;
  if (r - l == 1) return true;

  long long sum = 0;
  long long tot = r - l;
  for (int i = l; i < r; i++)
    sum += a[i];

  int pos = -1;
  for (int i = l; i < r; i++) {
    if (a[i] * tot >= sum) {
      pos = i;
      break;
    }
  }

  return !dfs(l, pos, a) || !dfs(pos, r, a);
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;

  vector<long long> a(n);
  for (int i = 0; i < n; i++)
    cin >> a[i];
  sort(a.begin(), a.end());

  if (dfs(0, n, a))
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  
  return 0;
}