#include <bits/stdc++.h>
using namespace std;

long long mod = 998244353;
//入力が必ず-mod<a<modの時.
struct mint{
    long long v = 0;
    mint(){} mint(int a){v = a<0?a+mod:a;} mint(long long a){v = a<0?a+mod:a;}
    mint(unsigned long long a){v = a;}
    long long val(){return v;}

    mint &operator=(const mint &b) = default;
    mint operator-() const {return mint(0)-(*this);}
    mint operator+(const mint b){return mint(v)+=b;}
    mint operator-(const mint b){return mint(v)-=b;}
    mint operator*(const mint b){return mint(v)*=b;}
    mint operator/(const mint b){return mint(v)/=b;}

    mint operator+=(const mint b){
        v += b.v; if(v >= mod) v -= mod;
        return *this;
    }
    mint operator-=(const mint b){
        v -= b.v; if(v < 0) v += mod; 
        return *this;
    }   
    mint operator*=(const mint b){v = v*b.v%mod; return *this;}
    mint operator/=(mint b){
        if(b == 0) assert(false);
        int left = mod-2;
        while(left){if(left&1) *this *= b; b *= b; left >>= 1;}
        return *this;
    }

    mint operator++(){*this += 1; return *this;}
    mint operator--(){*this -= 1; return *this;}
    mint operator++(int){*this += 1; return *this;}
    mint operator--(int){*this -= 1; return *this;}
    bool operator==(const mint b){return v == b.v;}
    bool operator!=(const mint b){return v != b.v;}
    bool operator>(const mint b){return v > b.v;}
    bool operator>=(const mint b){return v >= b.v;}
    bool operator<(const mint b){return v < b.v;}
    bool operator<=(const mint b){return v <= b.v;}

    mint pow(long long n){
        mint ret = 1,p = v;
        if(n < 0) p = p.inv(),n = -n;
        while(n){
            if(n&1) ret *= p;
            p *= p; n >>= 1;
        }
        return ret;
    }
    mint inv(){return mint(1)/v;}
};

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N; cin >> N;
    vector<int> A(N);
    int suma = 0;
    for(auto &a : A) cin >> a,suma += a;

    int K = 1001001001;
    auto check = [&]() -> int {
        int ret = -1;
        for(int i=1; i<=K; i*=2){
            int sum = 0;
            for(auto a : A) sum += a/i;
            if(sum == 0) break;
            if(sum%2){ret = i; break;}
        }
        return ret;
    };
    auto find = [&](int x) -> int {
        int ret = -1;
        for(int i=0; i<N; i++) if(A.at(i) >= x){ret = i; break;}
        assert(ret != -1);
        return ret;
    };

    auto ope = [&](int i,int x) -> int {
        assert(x <= K);
        K = x;
        cout << i+1 << " " << x << endl;
        A.at(i) -= x;
        int ret; cin >> ret;
        if(ret == -1) assert(false);
        return ret;
    };
    auto get = [&]() -> void {
        int a,b,c; cin >> a >> b >> c; a--;
        A.at(a) -= b; K = b;
        if(c == -1) assert(false);
    };

    int first = check();
    if(first == -1){
        cout << "Second" << endl;
        while(true){
            get();
            int x = check();
            int i = find(x);
            int ret = ope(i,x);
            if(ret == 1) return 0;
        }
    }
    else{
        cout << "First" << endl;
        while(true){
            int x = check();
            int i = find(x);
            int ret = ope(i,x);
            if(ret == 1) return 0;
            get();
        }
    }

}