#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
vvi edges;
vvi p;
vi par;
bool visited[1000005] = {};
int n;
ll sum;
void dfs(int id) {
  sum += id;
  visited[id] = 1;
  int x = par[id];
  x = (x + n) % (n * 2);
  if (x == 0) x = n * 2;
  if (!visited[x]) dfs(x);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  if (n % 2 == 0) {
    cout << "First" << endl;
    for (int i = 1; i <= n; i++) cout << i << ' ';
    for (int i = 1; i <= n; i++) cout << i << ' ';
    cout << endl;
  } else {
    cout << "Second" << endl;
    p.resize(n, vi());
    par.resize(n * 2 + 2);
    for (int i = 0; i < 2 * n; i++) {
      int x;
      cin >> x;
      p[--x].push_back(i + 1);
    }
    for (vi& v : p) {
      par[v.front()] = v.back();
      par[v.back()] = v.front();
    }
    for (int i = 1; i <= 2 * n; i++) {
      if (!visited[i] && !visited[par[i]]) dfs(i);
    }
    if (sum % (n * 2) == 0) {
      for (int i = 1; i <= 2 * n; i++)
        if (visited[i]) cout << i << ' ';
      cout << endl;
    } else {
      for (int i = 1; i <= 2 * n; i++)
        if (!visited[i]) cout << i << ' ';
      cout << endl;
    }
  }
}
