// In the name of God
#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <assert.h>
#include <bitset>
#define sqr(a) (a)*(a)
#define all(a) (a).begin(), (a).end()
using namespace std;
 
template <typename T>
T next_int() {
    T x = 0, p = 1;
    char ch;
    do { ch = getchar(); } while(ch <= ' ');
    if(ch == '-') {
        p = -1;
        ch = getchar();
    }
    while(ch >= '0' && ch <= '9') {
        x = x * 10 + (ch - '0');
        ch = getchar();
    }
    return p * x;
}
 
string next_token() {
    char ch;
    string ans = "";
    do { ch = getchar(); } while(ch <= ' ');
    while((ch >= '0' && ch <= '9') || (ch >= 'A' && ch <= 'Z') || (ch >= 'a' && ch <= 'z')) {
        ans += ch;
        ch = getchar();
    }
    return ans;
}
 
const long long INF = (long long)1e18;
const int INFINT = (int)1e9 + 227 + 1;
const int MOD = (int)1e9 + 7;
const long double EPS = 1e-9;
 
const int MAXM = (int)1e5 + 227 + 1;
 
int t[MAXM * 4];
 
void modi(int v, int l, int r, int p, int a) {
    if(l == r) {
        t[v] = a;
        return;
    }
 
    int mid = (l + r) / 2;
    if(p <= mid)
        modi(v * 2, l, mid, p, a);
    else
        modi(v * 2 + 1, mid + 1, r, p, a);
 
    t[v] = min(t[v * 2], t[v * 2 + 1]);
}
 
void add(int a, int times) {
    modi(1, 1, MAXM, a + 1, times);
}
 
int get(int v, int l, int r, int _l) {
    if(l == r) return l - 1;
 
    int mid = (l + r) / 2;
    if(t[v * 2] < _l)
        return get(v * 2, l, mid, _l);
    return get(v * 2 + 1, mid + 1, r, _l);
}
 
void init() {
    for(int i = 0; i < MAXM * 4; i++)
        t[i] = -(int)1e9;
}
 
int main() {
    init();
    int n;
    freopen("input.txt", "r", stdin);
    scanf("%d", &n);
 
    add(0, 0);
 
    int res = 0;
    for (int i = 1; i < n; i++) {
        int c, a;
        scanf("%d %d", &c, &a);
 
        int mex = get(1, 1, MAXM, i - c);
        if (a % 2)
            res ^= mex;
 
        add(mex, i);
    }
    if (res == 0)
        cout << "Second";
    else
        cout << "First";
    // cout << res;
}