#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<map>
#include<unordered_map>
#include<functional>
#include<set>
#include<numeric>

#pragma region
using namespace std;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define rep(i,n) FOR(i,0LL,n)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)
#define rrep(i,n) RFOR(i,0LL,n)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define COUNT(a,y,x) upper_bound(all(a), y) - lower_bound(all(a), x)
#define UNIQUE(a) sort(all(a)); a.erase(unique(all(a)), a.end())
#define SUM(a) accumulate(all(a),0LL)
#define pb push_back
#define endl '\n'
typedef long long int ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<string> vs;
typedef map<ll, ll> MAP;
const ll inf = 2222222222222222222LL;
const ll mod = 1000000007LL;

ll n = 0, m = 0, ans = 0, cnt = 0, tmp = 0, ma = -inf, mi = inf;
string s;
bool ok = true, flag = false;
ll dx[9] = { 0,1,-1,0,0,1,1,-1,-1 }, dy[9] = { 0,0,0,1,-1,1,-1,1,-1 };
#pragma endregion
#define MAX 222222


vll a;
ll sum[MAX];

bool solve(bool cur,ll le,ll ri) {
  ll acm = sum[ri] - sum[le - 1], num = ri - le + 1;
  ll mid;
  if (acm%num == 0) mid = COUNT(a, acm / num - 1, 0) - 1;
  else mid = COUNT(a, acm / num, 0) - 1;
  if (mid < le) return cur;
  if (solve(!cur, le, mid) == cur || solve(!cur, mid + 1, ri) == cur) return cur;
  else return !cur;
}


int main(void) {


  cin >> n;
  a.resize(n + 1);
  a[0] = 0;
  rep(i, n) cin >> a[i + 1];
  rep(i, n) sum[i + 1] = sum[i] + a[i + 1];
  if (solve(true, 1, n)) cout << "First" << endl;
  else cout << "Second" << endl;

  return 0;
}