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

using ll = long long;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) begin(v), end(v)

const int MAX_N = 10000;
const int MAX_S = 10000;
int main() {
  int N;
  cin >> N;
  vector A(N + 1, 0);
  rep(i, N) cin >> A[i + 1];
  int Ax = 0;
  for (int i : A) Ax ^= i;
  int K = *max_element(all(A));
  int myturn = 0;
  priority_queue<pii> pq;
  rep(i, N) { pq.push(pii{A[i + 1], i + 1}); }
  if (Ax) {
    K=Ax&-Ax;
    cout << "First" << endl;
    auto [v, i] = pq.top();
    pq.pop();
    cout << i << ' ' << K << endl;
    A[i] -= K;
    pq.push(pii{A[i], i});
    int ret;
    cin >> ret;
    if (ret != 0) {
      exit(0);
    }
  } else {
    cout << "Second" << endl;
  }
  while (1) {
    // Judge
    {
      int I, X;
      cin >> I >> X;
      A[I] -= X;
      assert(X >= 1 && X <= K);
      K = X;
      pq.push(pii{A[I], I});
      int ret;
      cin >> ret;
      if (ret != 0) exit(0);
    }
    // contestant
    {
      K = (K & -K);
      int I = -1;
      while (1) {
        auto [v, i] = pq.top();
        pq.pop();
        if (A[i] == v) {
          I = i;
          break;
        }
      }
      cout << I << ' ' << K << endl;
      A[I] -= K;
      pq.push(pii{A[I], I});
      int ret;
      cin >> ret;
      if (ret != 0) exit(0);
    }
  }
}