#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

struct vertex { ll l, r, g, p; };
vector<vertex> v;
vector<long double> A, SA;

ll cnt = 0;

void dfs(ll n=0) {
  // ll ddd = 0; rep(i,pow(10,7)) ddd++;
  if (A[v[n].l]==A[v[n].r]) v[n].g = 1;
  else {
    vector<ll> chi(3,0);
    long double ave = (SA[v[n].r+1] - SA[v[n].l]) / (v[n].r-v[n].l+1);
    ll lr = lower_bound(all(A), ave) - A.begin();

    cnt++; ll nc = cnt;
    v[cnt] = (vertex){v[n].l,lr-1,-1,n};
    dfs(cnt);
    chi[v[nc].g]++;

    cnt++; nc = cnt;
    v[cnt] = (vertex){lr,v[n].r,-1,n};
    dfs(cnt);
    chi[v[nc].g]++;

    // cout << n << "->"; debug(all(chi));
    if (chi[0]==0) v[n].g = 0;
    else if (chi[1]==0) v[n].g = 1;
    else v[n].g = 2;
  }
}

int main() {
  ll N; cin >> N;
  A.resize(N); rep(i,N) cin >> A[i];
  SA.resize(N+1,0); rep(i,N) SA[i+1] = SA[i] + A[i];
  v.resize(3*N); v[0] = (vertex){0,N-1,-1,-1};
  dfs();
  // rep(i,2*N+1) cout << v[i].l << "~" << v[i].r << " " << v[i].g << " " << v[i].p << endl;

  string result = v[0].g ? "First" : "Second";
  cout << result << endl;
  return 0;
}