I Want to Play Jenga

Shirogane and Shinomiya are playing Jenga.

Every block is a uniform rectangular cuboid of size $5\times 1\times 1$ and mass $1$. Each layer consists of $5$ parallel blocks placed side by side with no gaps. The block directions of two adjacent layers are perpendicular. The bottom layer is layer $1$, and the topmost layer is layer $H$.

The players alternate turns. On each turn, a player chooses one remaining block outside the topmost layer and removes it. Removed blocks are not placed back on the tower.

In this problem, whether the tower collapses is defined as follows. For every $i$ ($1\le i < H$), consider the following two objects.

• $P_i$: the vertical projection onto the plane of the top face of layer $i$ of the center of mass of all remaining blocks in layers $i+1,i+2,\ldots,H$.

The tower collapses if, for some $i$, $S_i$ is empty or $P_i$ is neither inside nor on the boundary of $S_i$. Otherwise, the tower does not collapse.

If removing a block makes the tower collapse, the player who removed it loses immediately. Therefore, a player also loses when there is no block that can be removed without making the tower collapse. Blocks in the topmost layer $H$ cannot be removed.

Given the height $H$ of the tower, determine the winner when both players play optimally. Shirogane moves first.

The input is given from Standard Input in the following format:

$T$ $\mathrm{case}_1$ $\mathrm{case}_2$

For each test case, print Shirogane if Shirogane wins, and print Shinomiya if Shinomiya wins.

• $1 \leq T \leq 200\,000$.
• $1 \leq H \leq 1\,000\,000$.