#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
#include <cmath>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<int(n); i++)
#define repr(i,n) for(int i=int(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001;
const char* yn(bool x){ return x ? "Yes" : "No"; }
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
template<typename A> using nega_queue = std::priority_queue<A,std::vector<A>,std::greater<A>>;
template<class R> auto ComparingBy(R f){ return [g=std::move(f)](auto l, auto r) -> bool { return g(l) < g(r); }; }
#include <atcoder/modint>
#include <atcoder/dsu>
using Modint = atcoder::static_modint<998244353>;
using namespace std;

void testcase(){
    i64 N; cin >> N;
    vector<i64> Q;
    Q.push_back(0);
    rep(i,N){
        i64 l,r; cin >> l >> r;
        Q.push_back(l-1);
        Q.push_back(r);
    }
    i64 g = 0;
    i64 w = 0;
    repr(i,N){
        i64 c = Q[i*2+1] - Q[i*2+0];
        if(i == 0 && c == 0) break;
        if(w % 2 == 0){
            i64 x = Q[i*2+2] - Q[i*2+1];
            g ^= x;
        }
        w += c;
    }
    cout << (g == 0 ? "Second" : "First") << endl;
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    testcase();
    return 0;
}