#include <bits/stdc++.h>
using namespace std;
int n, ans, a[1000010];
pair<int, int> pp[1000010];
vector<int> G[1000010];
int col[1000010], vis[1000010];
void dfs(int x, int co) {
  if (vis[x]) return;
  vis[x] = 1;
  col[x] = co;
  for (int i = 0; i < G[x].size(); i++) {
    dfs(G[x][i], co ^ 1);
  }
  return;
}
int main() {
  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;
    cin >> n;
    return 0;
  }
  cout << "Second" << endl;
  for (int i = 1; i <= n * 2; i++) {
    cin >> a[i];
    if (pp[a[i]].first == 0)
      pp[a[i]].first = i;
    else
      pp[a[i]].second = i;
  }
  for (int i = 1; i <= n; i++) {
    G[i].push_back(i + n);
    G[i + n].push_back(i);
    if (pp[i].second + n != pp[i].first && pp[i].second != pp[i].first + n) {
      G[pp[i].second].push_back(pp[i].first);
      G[pp[i].first].push_back(pp[i].second);
    }
  }
  for (int i = 1; i <= n * 2; i++) {
    if (!vis[i]) dfs(i, 0);
  }
  long long ans = 0;
  for (int i = 1; i <= n * 2; i++) {
    if (col[i] == 1) ans += i;
  }
  if (ans % (n * 2ll) == 0) {
    for (int i = 1; i <= n * 2; i++) {
      if (col[i]) cout << i << " ";
    }
    cout << endl;
    cin >> n;
    return 0;
  }
  for (int i = 1; i <= n * 2; i++) {
    if (!col[i]) cout << i << " ";
  }
  cout << endl;
  cin >> n;
  return 0;
}
