#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long int llINF = (long long)(1e18) + 100;
const int MAXN = 1e6 + 10;
vector<long long int> v[MAXN], adj[MAXN];
long long int vis[MAXN];
void dfs(int v, int c) {
  vis[v] = c;
  if (c == 1)
    c = 2;
  else
    c = 1;
  for (auto x : adj[v])
    if (vis[x] == 0) dfs(x, c);
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n;
  cin >> n;
  if (n % 2 == 0) {
    cout << "First" << endl;
    for (int i = 0; i < 2 * n; i++) cout << ((i % n) + 1) << ' ';
    cout << endl;
  } else {
    cout << "Second" << endl;
    long long int x;
    for (int i = 1; i <= 2 * n; i++) {
      cin >> x;
      v[x].push_back(i);
    }
    for (int i = 1; i <= n; i++) {
      adj[i].push_back(i + n);
      adj[i + n].push_back(i);
    }
    for (int i = 1; i <= n; i++) {
      adj[v[i][0]].push_back(v[i][1]);
      adj[v[i][1]].push_back(v[i][0]);
    }
    for (int i = 1; i <= 2 * n; i++)
      if (vis[i] == 0) dfs(i, 1);
    long long int sum = 0;
    for (int i = 1; i <= 2 * n; i++)
      if (vis[i] == 1) sum += i;
    if (sum % 2 * n == 0) {
      for (int i = 1; i <= 2 * n; i++)
        if (vis[i] == 1) cout << i << ' ';
      cout << endl;
    } else {
      for (int i = 1; i <= 2 * n; i++)
        if (vis[i] == 2) cout << i << ' ';
      cout << endl;
    }
  }
}
