#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INFF = 0x3f3f3f3f3f3f3f3fll;
const long long M = 1e9 + 7;
const long long maxn = 1e6 + 107;
const double pi = acos(-1.0);
const double eps = 0.0000000001;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
template <typename T>
inline void pr2(T x, int k = 64) {
  long long i;
  for (i = 0; i < k; i++) fprintf(stderr, "%d", (x >> i) & 1);
  putchar(' ');
}
template <typename T>
inline void add_(T &A, int B, long long MOD = M) {
  A += B;
  (A >= MOD) && (A -= MOD);
}
template <typename T>
inline void mul_(T &A, long long B, long long MOD = M) {
  A = (A * B) % MOD;
}
template <typename T>
inline void mod_(T &A, long long MOD = M) {
  A %= MOD;
  A += MOD;
  A %= MOD;
}
template <typename T>
inline void max_(T &A, T B) {
  (A < B) && (A = B);
}
template <typename T>
inline void min_(T &A, T B) {
  (A > B) && (A = B);
}
template <typename T>
inline T abs(T a) {
  return a > 0 ? a : -a;
}
inline long long powMM(long long a, long long b, long long mod = M) {
  long long ret = 1;
  for (; b; b >>= 1ll, a = a * a % mod)
    if (b & 1) ret = ret * a % mod;
  return ret;
}
int startTime;
void startTimer() { startTime = clock(); }
void printTimer() {
  fprintf(stderr, "/--- Time: %ld milliseconds ---/\n", clock() - startTime);
}
int mark[maxn];
int id[maxn];
vector<int> edge[maxn];
void dfs(int x, int y) {
  mark[x] = y;
  for (int v : edge[x])
    if (mark[v] == -1) dfs(v, y ^ 1);
}
int A[maxn];
int main() {
  int n, i;
  scanf("%d", &n);
  if (n % 2 == 1) {
    puts("Second");
    fflush(stdout);
    for (i = 1; i <= n * 2; i++) scanf("%d", &A[i]);
    for (i = 1; i <= n * 2; i++) id[A[i]] = i;
    for (i = 1; i <= n * 2; i++)
      if (id[A[i]] != i) {
        edge[i].push_back(id[A[i]]);
        edge[id[A[i]]].push_back(i);
      }
    for (i = 1; i <= n; i++) {
      edge[i].push_back(i + n);
      edge[i + n].push_back(i);
    };
    for (i = 1; i <= n * 2; i++) mark[i] = -1;
    for (i = 1; i <= n * 2; i++)
      if (mark[i] == -1) dfs(i, 0);
    long long ans = 0;
    for (i = 1; i <= n * 2; i++)
      if (mark[i] == 0) ans += i;
    if (ans % (n * 2) == 0) {
      for (i = 1; i <= n * 2; i++)
        if (mark[i] == 0) printf("%d%c", i, " \n"[i == n]);
    } else {
      for (i = 1; i <= n * 2; i++)
        if (mark[i] == 1) printf("%d%c", i, " \n"[i == n]);
    }
  } else {
    puts("First");
    for (i = 1; i <= n * 2; i++) printf("%d%c", i % n + 1, " \n"[i == n * 2]);
  }
  fflush(stdout);
  scanf("%*d");
}
