#include <bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class T>
void IN(T& x) {
  cin >> x;
}
template <class H, class... T>
void IN(H& h, T&... t) {
  IN(h);
  IN(t...);
}
template <class T1, class T2>
void OUT(const pair<T1, T2>& x);
template <class T>
void OUT(const T& x) {
  cout << x;
}
template <class H, class... T>
void OUT(const H& h, const T&... t) {
  OUT(h);
  OUT(t...);
}
template <class T1, class T2>
void OUT(const pair<T1, T2>& x) {
  OUT(x.first, ' ', x.second);
}
template <class... T>
void OUTL(const T&... t) {
  OUT(t..., "\n");
}
template <class H>
void OUTLS(const H& h) {
  OUTL(h);
}
template <class H, class... T>
void OUTLS(const H& h, const T&... t) {
  OUT(h, ' ');
  OUTLS(t...);
}
void program();
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  program();
}
const int MX = 1e6;
int n;
int p[MX];
int m[MX];
int q[MX][2];
int pos[MX];
vector<int> chosen;
long long ans = 0;
void choose(int x) {
  chosen.push_back(x);
  ans += x;
  pos[x] = 0;
  if (q[p[x]][0] == x) swap(q[p[x]][0], q[p[x]][1]);
  pos[q[p[x]][0]] = 0;
  int y = (x > n ? x - n : x + n);
  pos[y] = 0;
  if (q[p[y]][0] == y) swap(q[p[y]][0], q[p[y]][1]);
  if (pos[q[p[y]][0]]) choose(q[p[y]][0]);
}
void program() {
  IN(n);
  if ((n % 2) == 0) {
    OUTL("First");
    for (int i = int(0); i < int(n * 2); i++)
      OUT(i == 0 ? "" : " ", (i % n) + 1);
    OUTL();
    cout.flush();
  } else {
    OUTL("Second");
    cout.flush();
    for (int i = int(1); i < int(n * 2 + 1); i++) IN(p[i]);
    for (int i = int(1); i < int(n * 2 + 1); i++) pos[i] = 1;
    for (int i = int(1); i < int(n + 1); i++) m[i] = 0;
    for (int i = int(1); i < int(n * 2 + 1); i++) q[p[i]][m[p[i]]++] = i;
    for (int i = int(1); i < int(n * 2 + 1); i++)
      if (pos[i]) choose(i);
    if ((ans % (n * 2)) == 0) {
      sort(chosen.begin(), chosen.end());
    } else {
      for (int i = int(1); i < int(n * 2 + 1); i++) pos[i] = 1;
      for (auto& i : chosen) pos[i] = 0;
      chosen.clear();
      for (int i = int(1); i < int(n * 2 + 1); i++)
        if (pos[i]) chosen.push_back(i);
    }
    bool f = 1;
    for (auto& i : chosen) OUT(f ? "" : " ", i), f = 0;
    OUTL();
    cout.flush();
  }
}
