#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } const long long MAX = 5100000; const long long INF = 1LL << 60; const int inf = 1 << 28; const long long mod = 1000000007LL; //const long long mod = 998244353LL; using namespace std; typedef unsigned long long ull; typedef long long ll; vector a; vector sum; bool dfs(int left, int right) { ll s = (sum[right] - sum[left]) / (right - left); ll idx = upper_bound(a.begin() + left, a.begin() + right, s) - a.begin(); if (idx == right) return true; bool flag = false; flag |= !dfs(left, idx); flag |= !dfs(idx, right); return flag; } int main() { /* cin.tie(nullptr); ios::sync_with_stdio(false); */ ll N; scanf("%lld", &N); a.resize(N); for (ll i = 0; i < N; i++) scanf("%lld", &a[i]); sort(a.begin(), a.end()); sum.resize(N + 1); for (int i = 0; i < N; i++) sum[i + 1] = sum[i] + a[i]; if (dfs(0, N)) puts("First"); else puts("Second"); return 0; /* おまじないを使ったらscanfとprintf関連注意!!!!!!!!!!!! */ }