#include <bits/stdc++.h>
using namespace std;
const int N = 500005;
const int inf = 1000 * 1000 * 1000;
const int mod = 1000 * 1000 * 1000 + 7;
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
int n;
vector<int> g[N * 2];
int go[N * 2];
int xumb[2 * N];
int used[2 * N];
vector<int> mas[2 * N];
long long sum = 0;
vector<int> res;
void dfs(int v, int r) {
  used[v] = true;
  if (r == 0) {
    sum += v;
    res.push_back(v);
  }
  for (int i = 0; i < (int)mas[v].size(); i++) {
    int to = mas[v][i];
    if (used[to]) continue;
    dfs(to, 1 - r);
  }
}
int main() {
  cin >> n;
  if (n % 2 == 0) {
    printf("First\n");
    cout.flush();
    for (int i = 0; i < 2 * n; i++) {
      printf("%d ", i % n + 1);
    }
    printf("\n");
    cout.flush();
    int x;
    cin >> x;
  } else {
    printf("Second\n");
    cout.flush();
    for (int i = 0; i < 2 * n; i++) {
      int x;
      scanf("%d", &x);
      xumb[i + 1] = x;
      g[x].push_back(i + 1);
    }
    for (int i = 1; i <= n; i++) {
      mas[i].push_back(n + i);
      mas[n + i].push_back(i);
      mas[g[i][1]].push_back(g[i][0]);
      mas[g[i][0]].push_back(g[i][1]);
      go[g[i][1]] = g[i][0];
      go[g[i][0]] = g[i][1];
    }
    for (int i = 1; i <= 2 * n; i++) {
      if (used[i]) continue;
      dfs(i, 0);
    }
    if (sum % (2 * n) == 0) {
      for (int i = 0; i < n; i++) {
        printf("%d ", res[i]);
      }
      printf("\n");
      cout.flush();
    } else {
      for (int i = 0; i < n; i++) {
        printf("%d ", go[res[i]]);
      }
      printf("\n");
      cout.flush();
    }
    int x;
    cin >> x;
  }
  return 0;
}
