#include <bits/stdc++.h>
#include <atcoder/all>
#include <cassert>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)

template <typename T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <typename T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

struct IOST {
	IOST() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(20);
	}
} IOST;

using mint = atcoder::modint998244353;

void solve() {
	int n;
	cin >> n;
	vector<int> a(n);
	rep(i, 0, n) cin >> a[i];
	auto check_a = [&]() {
		rep(b, 0, 15) {
			int bit = (1 << b);
			int flg = 0;
			rep(i, 0, n) flg ^= ((a[i] / bit) & 1);
			if (flg) return bit;
		}
		return -1;
	};
	set<int> st;
	rep(i, 0, n) st.insert(i);
	int nk = 1e9;
	auto get_judge = [&]() {
		int i, x;
		cin >> i >> x;
		i--;
		a[i] -= x;
		chmin(nk, x);
		if (a[i] == 0) st.erase(i);
	};
	int x = check_a();
	int ret;
	if (x == -1) {
		cout << "Second" << endl;
		get_judge();
		x = check_a();
		cin >> ret;
		if (ret == -1) return;
		assert(x <= nk);
	} else {
		cout << "First" << endl;
	}
	while (1) {
		int ci = -1;
		while (1) {
			for (int i : st) {
				if (a[i] >= x) {
					ci = i;
					break;
				}
			}
			if (ci == -1) x /= 2;
			else break;
		}
		cout << ci + 1 << " " << x << endl;
		a[ci] -= x;
		if (a[ci] == 0) st.erase(ci);
		cin >> ret;
		if (ret != 0) break;

		get_judge();
		cin >> ret;
		if (ret != 0) break;

		if (nk < x) x = check_a();
	}
}

int main() {
	int t = 1;
	// cin >> t;
	rep(i, 0, t) solve();
}