#include <bits/stdc++.h>
using namespace std;
int a[1 << 12], p[1 << 12], q[1 << 12], posp[1 << 12], posq[1 << 12];
int main() {
  int i;
  int k, x = 0;
  scanf("%d", &k);
  for (i = 0; i < (1 << k); i++) scanf("%d", &a[i]), x ^= a[i];
  if (x != 0) {
    printf("Fou\n");
    return 0;
  }
  for (i = 0; i < (1 << k); i++) p[i] = q[i] = posp[i] = posq[i] = i;
  for (i = 0; i < (1 << k) - 1; i++) {
    while ((a[i] ^ p[i] ^ q[i]) != 0) {
      x = a[i] ^ p[i] ^ q[i];
      while (1) {
        int u = i, c = 0;
        do {
          c++;
          if (c & 1)
            u = posp[p[u] ^ x];
          else
            u = posq[q[u] ^ x];
        } while ((u != i) && (u != i + 1));
        if (u == i + 1) {
          u = i, c = 0;
          do {
            c++;
            if (c & 1) {
              int v = posp[p[u] ^ x];
              swap(p[u], p[v]), swap(posp[p[u]], posp[p[v]]);
              u = v;
            } else {
              int v = posq[q[u] ^ x];
              swap(q[u], q[v]), swap(posq[q[u]], posq[q[v]]);
              u = v;
            }
          } while (u != i + 1);
          break;
        } else
          x = rand() % (1 << k);
      }
    }
  }
  printf("Shi\n");
  for (i = 0; i < (1 << k); i++) printf("%d ", p[i]);
  printf("\n");
  for (i = 0; i < (1 << k); i++)
    printf("%d ", q[i]), assert((p[i] ^ q[i] ^ a[i]) == 0);
  printf("\n");
  return 0;
}
