#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;
}
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];
    }
    l.push_back(INF);
    r.push_back(INF);
    vector<ll> tl,tr;
    ll nl=l[0];
    rep(i,n){
        if(r[i]+1==l[i+1]) continue;
        tl.push_back(nl);
        tr.push_back(r[i]);
        nl=l[i+1];
    }
    l=tl;
    r=tr;
    n=(ll)l.size();
    ll sum=0;
    rep(i,n) sum+=r[i]-l[i]+1;
    ll g=0;
    rep(i,n){
        ll sz=r[i]-l[i]+1;
        if(l[i]%2==0&&i%2==0) g^=sz/2*2^(sum%2);
        if(l[i]%2==0&&i%2==1) g^=1^(sum%2);
        if(l[i]%2==1&&i%2==0) g^=(sz%2)^(sum%2);
        if(l[i]%2==1&&i%2==1) g^=(sz+sz%2*-2+1)^(sum%2);
    }
    if(g==0) cout << "Second\n";
    else cout << "First\n";
}