#include <bits/stdc++.h>
#pragma warning(disable : 4996)
int __builtin_popcount(int n) {
  int x = 0;
  while (n) n -= n & (-n), x++;
  return x;
}
using namespace std;
const int mod = 1000000009;
const int inf = 2012345678;
const long long infl = 9012345678901234567;
const double pi = 3.1415926535897932384626433832795;
const int N = (1 << 12) + 10;
int a[N], s[N], t[N], rt[N], b[N], c[N], chk[N], se[N], m;
int main() {
  freopen("input.txt", "r", stdin);
  int k;
  scanf("%d", &(k));
  for (int i = 0; i < (1 << k); i++) scanf("%d", &(a[i]));
  int X = 0;
  for (int i = 0; i < (1 << k); i++) X ^= a[i];
  if (X) return puts("Fou"), 0;
  puts("Shi");
  for (int i = 0; i < (1 << k); i++) s[i] = t[i] = i;
  for (int i = 0; i < (1 << k); i++) {
    if (a[i] == b[i]) continue;
    for (int j = 0; j < (1 << k); j++) rt[t[j]] = j, c[j] = b[j], chk[j] = 0;
    m = 2;
    se[0] = i;
    se[1] = i + 1;
    chk[i] = chk[i + 1] = 1;
    int X = a[i] ^ b[i];
    c[i] ^= X;
    c[i + 1] ^= X;
    int p = 0;
    while (1) {
      int j = rt[c[se[m - 1]] ^ s[se[m - 2]]];
      se[m] = j;
      if (chk[j]) {
        if (j == se[1]) p = 1;
        break;
      }
      chk[j] = 1;
      m++;
    }
    int ss = s[se[m - 1]];
    for (int i = m; --i;) s[se[i]] = s[se[i - 1]];
    s[se[0]] = ss;
    ss = t[se[p ^ 1]];
    int tt = t[se[p]];
    for (int j = 1; j < m; j++) t[se[j]] = t[se[j + 1]];
    if (p == 1) t[se[m - 1]] = tt;
    t[se[0]] = ss;
    b[i] = c[i];
    b[i + 1] = c[i + 1];
  }
  for (int i = 0; i < (1 << k); i++) printf("%d ", t[i]);
  puts("");
  for (int i = 0; i < (1 << k); i++) printf("%d ", s[i]);
  puts("");
  return 0;
}
