#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll,ll>;
using ld=long double;
const ll INF=(1ll<<60);
#define rep(i,n) for (ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(),v.end()
template<class T> inline bool chmin(T &a,T b){
    if(a>b){
        a=b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T &a,T b){
    if(a<b){
        a=b;
        return true;
    }
    return false;
}
auto time_start=chrono::system_clock::now();
map<set<ll>,ll> mp;
ll f(set<ll> st){
    if(mp.count(st)) return mp[st];
    set<ll> now;
    for(auto x:st){
        ll x2=-1;
        for(ll y=x-1;1<=y;y--){
            auto time_now=chrono::system_clock::now();
    int ms=chrono::duration_cast<chrono::milliseconds>(time_now-time_start).count();
    if(500<ms) assert(0);
            if(st.count(y)) continue;
            x2=y;
            break;
        }
        if(x2==-1) continue;
        set<ll> nst=st;
        nst.erase(x);
        nst.insert(x2);
        now.insert(f(nst));
    }
    ll mex=0;
    while(now.count(mex)) mex++;
    return mp[st]=mex;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll n;
    cin >> n;
    vector<ll> l(n),r(n);
    rep(i,n) cin >> l[i] >> r[i];
    set<ll> start;
    rep(i,n){
        for(ll j=l[i];j<=r[i];j++) start.insert(j);
    }
    if(f(start)) cout << "First\n";
    else cout << "Second\n";
}