/*
    Author:zeke
    
    pass System Test!
    GET AC!!
*/
#include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <math.h>
#include <utility>
#include <stack>
#include <bitset>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var))
#define Mp(a, b) make_pair((a), (b))
#define F first
#define S second
#define Icin(s) \
    ll(s);      \
    cin >> (s);
#define Scin(s) \
    ll(s);      \
    cin >> (s);
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll mod = 1e9 + 7;
unsigned long long MOD = 1e9 + 7;
ll INF = 1e18;
V vec;
V vec2;
bool dfs(int a,int b){
    
    if(a==b){
     //   cout<<a<<" "<<b<<" "<<"false"<<endl;
        return false;
    }
    ll sum;
    if(a==0){
        sum=vec2[b-1];
    }else{
        sum=vec2[b-1]-vec2[a-1];
    }
    
    ld ave=(ld)sum/(b-a);
    ll k = lower_bound(all(vec), (ld)ave) - vec.begin();
 //   cout<<a<<" "<<b<<" "<<k<<" "<<ave<<endl;
    if(!dfs(a,k)||!dfs(k,b)){
   //     cout<<a<<" "<<b<<" "<<"true"<<endl;
        return true;
    }else{
     //   cout<<a<<" "<<b<<" "<<"false"<<endl;
        return false;
    }
}
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll n;
    cin >> n;
    vec.resize(n);
    rep(i, n) cin >> vec[i];
    vec2.resize(n);
    vec2[0] = vec[0];
    rep3(i,1,n){
        vec2[i] = vec[i]+vec2[i-1];
    }
    if(dfs(0,n)){
        cout << "First" << endl;
    }else{
        cout << "Second" << endl;
    }
}