Little Sub and Johann are good friends and they often play games together. Recently, they like playing with stones.

They have n piles of stones initially and they should make one of following movements by turns:

1.Erase a pile of stones.

2.Suppose there is a stone pile which has x stones, you can erase y stones from it but the greatest common divisor of x and y should be 1.

If someone cannot make any legal movement, the other person win the game. We all know that Little Sub and Johann are very genius and will always follow the optimal strategy. If Little Sub take the first move, please tell us who will win the game eventually.

There are multiple cases. the first line contains an integer T(1 ≤ T ≤ 100), indicating the number of cases.

There will be two line for each case. The first line contains a integer n(1 ≤ n ≤ 100), indicating the number of stones piles.

The second line will be n integers Ai(1 ≤ Ai ≤ 10^6), indicating the number of stones in the ith pile.

For each case please output exactly one line.

If Little Sub will win, please output ’Subconscious is our king!’. If Johann will win, please output ’Long live with King Johann!’