#include <bits/stdc++.h>
using namespace std;
int main() {
  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;
    vector<int> p(2 * n + 1);
    vector<vector<int>> pairs(n);
    for (int i = 1; i < 2 * n + 1; ++i) {
      cin >> p[i];
      --p[i];
      pairs[p[i]].push_back(i);
    }
    vector<bool> visited(n);
    vector<int> loop(n);
    vector<int> a(n);
    function<int(int, int, int)> dfs = [&](int v, int m, int c) {
      if (visited[v]) return -1;
      visited[v] = true;
      int u;
      if (pairs[v][1] == m) {
        a[v] = 0;
        u = pairs[v][0];
      } else {
        a[v] = 1;
        u = pairs[v][1];
      }
      if (u <= n)
        u += n;
      else
        u -= n;
      int t = p[u];
      if (!visited[t]) c = dfs(t, u, c + 1);
      loop[v] = c;
      return c;
    };
    for (int i = 0; i < n; ++i) dfs(i, -1, 1);
    long long sum = 0;
    for (int i = 0; i < n; ++i) {
      sum += pairs[i][a[i]];
    }
    if (sum % 2 != 0) {
      int i;
      for (; i < n; ++i) {
        if (loop[i] % 2 != 0) break;
      }
      a[i] = 1 - a[i];
      function<int(int)> next = [&](int v) {
        int u = pairs[v][a[v]];
        if (u <= n) {
          u += n;
        } else {
          u -= n;
        }
        return p[u];
      };
      int j = next(i);
      while (j != i) {
        a[j] = 1 - a[j];
        j = next(j);
      }
    }
    for (int i = 0; i < n; ++i) {
      cout << pairs[i][a[i]] << " ";
    }
    cout << endl;
  }
  int ans;
  cin >> ans;
  return 0;
}
