#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; ++i) cin >> a[i];
  int cnt[15] = {0};
  for (int i = 0; i < 15; ++i) for (int j = 0; j < n; ++j) cnt[i] += a[j] / (1 << i);
  int ret = -2;
  for (int i = 0; i < 15; ++i)
  {
    if (cnt[i] % 2)
    {
      cout << "First" << endl;
      for (int j = 0; j < n; ++j)
      {
        if (a[j] >= (1 << i))
        {
          cout << j + 1 << ' ' << (1 << i) << endl;
          for (int k = 0; k < 15; ++k) cnt[k] -= a[j] / (1 << k);
          a[j] -= (1 << i);
          for (int k = 0; k < 15; ++k) cnt[k] += a[j] / (1 << k);
          cin >> ret;
          break;
        }
      }
      break;
    }
  }
  int id, x;
  if (ret == -2) cout << "Second" << endl;
  while (true)
  {
    cin >> id >> x;
    --id;
    for (int i = 0; i < 15; ++i) cnt[i] -= a[id] / (1 << i); 
    a[id] -= x;
    for (int i = 0; i < 15; ++i) cnt[i] += a[id] / (1 << i); 
    cin >> ret;
    if (ret != 0) return 0;
    for (int i = 0; i < 15; ++i)
    {
      if (cnt[i] % 2)
      {
        for (int j = 0; j < n; ++j)
        {
          if (a[j] >= (1 << i))
          {
            cout << j + 1 << ' ' << (1 << i) << endl;
            for (int k = 0; k < 15; ++k) cnt[k] -= a[j] / (1 << k);
            a[j] -= (1 << i);
            for (int k = 0; k < 15; ++k) cnt[k] += a[j] / (1 << k);
            cin >> ret;
            if (ret != 0) return 0;
            break;
          }
        }
        break;
      }
    }
  }
}