#include <bits/stdc++.h>
using namespace std;
const int N = 1 << 12;
template <typename T>
inline void read(T &x) {
  int ch = getchar();
  x = 0;
  while (ch < '0' || ch > '9') ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
}
int n, k, sum, a[N], p[N], q[N], pre[N], v[N];
inline void fix(int i, int j) {
  int d = q[i] ^ v[i], k = pre[d];
  if (k == i) return;
  if (k == j) return swap(p[i], p[j]), swap(pre[p[i]], pre[p[j]]);
  swap(p[k], p[i]);
  swap(q[k], q[j]);
  swap(pre[p[i]], pre[p[k]]);
  fix(k, j);
}
int main() {
  read(k);
  n = 1 << k;
  for (register int i = 0; i < n; ++i)
    read(a[i]), p[i] = q[i] = pre[i] = i, sum ^= a[i];
  if (sum) return puts("Fou"), 0;
  puts("Shi");
  for (register int i = 0; i < n - 1; ++i)
    if (v[i] != a[i]) {
      int d = v[i] ^ a[i];
      v[i] ^= d;
      v[i + 1] ^= d;
      fix(i, i + 1);
    }
  for (register int i = 0; i < n; ++i) printf("%d%c", p[i], " \n"[i == n - 1]);
  for (register int i = 0; i < n; ++i) printf("%d%c", q[i], " \n"[i == n - 1]);
}
