#include <bits/stdc++.h>
int L[1111111], R[1111111], p[1111111], vis[1111111];
int main() {
  int n;
  scanf("%d", &n);
  if (n % 2 == 0) {
    puts("First");
    for (int i = 1; i <= n; ++i) printf("%d ", i);
    for (int i = 1; i <= n; ++i) printf("%d ", i);
    fflush(stdout);
  } else {
    puts("Second");
    fflush(stdout);
    for (int i = 1; i <= 2 * n; ++i) {
      scanf("%d", p + i);
      if (L[p[i]])
        R[p[i]] = i;
      else
        L[p[i]] = i;
    }
    for (int i = 1; i <= n; ++i)
      if (!vis[i]) {
        int cur = i, w = L[i];
        while (!vis[cur]) {
          if (L[cur] % n != w % n) {
            int t = L[cur];
            L[cur] = R[cur];
            R[cur] = t;
          }
          vis[cur] = L[cur], w = R[cur];
          cur = R[cur] > n ? p[R[cur] - n] : p[R[cur] + n];
        }
      }
    long long sum = 0;
    for (int i = 1; i <= n; ++i) sum += vis[i];
    if (sum % (2 * n)) {
      for (int i = 1; i <= n; ++i) {
        if (vis[i] == L[i])
          vis[i] = R[i];
        else
          vis[i] = L[i];
      }
    }
    for (int i = 1; i <= n; ++i) printf("%d ", vis[i]);
    fflush(stdout);
  }
}
