#include <bits/stdc++.h>
using namespace std;
int k, n;
int a[5007];
int now[5007], p[5007], q[5007], pos[5007];
void update(int i, int j) {
  int k = pos[q[i] ^ now[i]];
  if (k == i) return;
  if (k == j) {
    swap(p[i], p[j]);
    swap(pos[p[i]], pos[p[j]]);
    return;
  }
  swap(pos[p[i]], pos[p[k]]);
  swap(p[i], p[k]);
  swap(q[j], q[k]);
  update(k, j);
}
int main() {
  scanf("%d", &k);
  n = 1 << k;
  int s = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    s ^= a[i];
  }
  if (s != 0) {
    printf("Fou\n");
    return 0;
  }
  printf("Shi\n");
  for (int i = 0; i < n; i++) {
    p[i] = i;
    q[i] = i;
    pos[i] = i;
  }
  for (int i = 0; i < n; i++)
    if (now[i] != a[i]) {
      int tmp = now[i] ^ a[i];
      now[i] ^= tmp;
      now[i + 1] ^= tmp;
      update(i, i + 1);
    }
  for (int i = 0; i < n; i++) printf("%d ", p[i]);
  printf("\n");
  for (int i = 0; i < n; i++) printf("%d ", q[i]);
  printf("\n");
  return 0;
}

### Prompt

Generate a Cpp solution to the following problem:

Toad Mikhail has an array of 2^k integers a_1, a_2, …, a_{2^k}.

Find two permutations p and q of integers 0, 1, …, 2^k-1, such that a_i is equal to p_i ⊕ q_i for all possible i, or determine there are no such permutations. Here ⊕ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR).

Input

The first line contains one integer k (2 ≤ k ≤ 12), denoting that the size of the array is 2^k.

The next line contains 2^k space-separated integers a_1, a_2, …, a_{2^k} (0 ≤ a_i < 2^k) — the elements of the given array.

Output

If the given array can't be represented as element-wise XOR of two permutations of integers 0, 1, …, 2^k-1, print "Fou".

Otherwise, print "Shi" in the first line.

The next two lines should contain the description of two suitable permutations. The first of these lines should contain 2^k space-separated distinct integers p_{1}, p_{2}, …, p_{2^k}, and the second line should contain 2^k space-separated distinct integers q_{1}, q_{2}, …, q_{2^k}.

All elements of p and q should be between 0 and 2^k - 1, inclusive; p_i ⊕ q_i should be equal to a_i for all i such that 1 ≤ i ≤ 2^k. If there are several possible solutions, you can print any.

Examples

Input


2
0 1 2 3


Output


Shi
2 0 1 3 
2 1 3 0 


Input


2
0 0 0 0


Output


Shi
0 1 2 3 
0 1 2 3 


Input


2
0 1 2 2


Output


Fou

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int k, n;
int a[5007];
int now[5007], p[5007], q[5007], pos[5007];
void update(int i, int j) {
  int k = pos[q[i] ^ now[i]];
  if (k == i) return;
  if (k == j) {
    swap(p[i], p[j]);
    swap(pos[p[i]], pos[p[j]]);
    return;
  }
  swap(pos[p[i]], pos[p[k]]);
  swap(p[i], p[k]);
  swap(q[j], q[k]);
  update(k, j);
}
int main() {
  scanf("%d", &k);
  n = 1 << k;
  int s = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    s ^= a[i];
  }
  if (s != 0) {
    printf("Fou\n");
    return 0;
  }
  printf("Shi\n");
  for (int i = 0; i < n; i++) {
    p[i] = i;
    q[i] = i;
    pos[i] = i;
  }
  for (int i = 0; i < n; i++)
    if (now[i] != a[i]) {
      int tmp = now[i] ^ a[i];
      now[i] ^= tmp;
      now[i + 1] ^= tmp;
      update(i, i + 1);
    }
  for (int i = 0; i < n; i++) printf("%d ", p[i]);
  printf("\n");
  for (int i = 0; i < n; i++) printf("%d ", q[i]);
  printf("\n");
  return 0;
}

```