#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int vis[N];
bool cho[N];
int a[N], match[N];
int main() {
  int n;
  ios::sync_with_stdio(0);
  cin >> n;
  if (n % 2 == 0) {
    cout << "First" << endl;
    for (int i = 1; i <= 2 * n; ++i)
      if (i != 2 * n)
        cout << (i - 1) % n + 1 << " ";
      else
        cout << (i - 1) % n + 1 << endl;
  } else {
    cout << "Second" << endl;
    for (int i = 1; i <= 2 * n; ++i) cin >> a[i];
    for (int i = 1; i <= 2 * n; ++i)
      if (!vis[a[i]])
        vis[a[i]] = i;
      else {
        match[i] = vis[a[i]];
        match[vis[a[i]]] = i;
        vis[a[i]] = 0;
      }
    long long tot = 0;
    for (int i = 1; i <= 2 * n; ++i)
      if (!vis[a[i]]) {
        int now = i;
        while (!vis[a[now]]) {
          tot += now;
          vis[a[now]] = 1;
          cho[now] = 1;
          now = match[now <= n ? now + n : now - n];
        }
      }
    if (tot % (2 * n) == 0) {
      for (int i = 1; i <= 2 * n; ++i)
        if (cho[i]) cout << i << " ";
      cout << endl;
    } else {
      for (int i = 1; i <= 2 * n; ++i)
        if (!cho[i]) cout << i << " ";
      cout << endl;
    }
  }
  int x;
  cin >> x;
  return 0;
}
