Question
Guess the winner!
Ninu and Yash play a game. They start with the integer N and take turns, with Ninu going first.
On their turn, a player must select an odd prime factor p of N, and subtract it from N (so N changes to N − p).
The player who cannot make a move loses (that is, if either N = 0 or N has no odd prime factors).
If Ninu and Yash play optimally, who wins the game?
Input
The first line of input will contain a single integer T, denoting the number of test cases.
The only line of each test case contains a single integer N - the value Ninu and Yash start with.
Constraints
1 ≤ T ≤ 105
1 ≤ N ≤ 109
The only line of each test case contains a single integer N - the value Ninu and Yash start with.
Constraints
1 ≤ T ≤ 105
1 ≤ N ≤ 109
Output
For each test case, output on a new line the winner of the game - either "Ninu" or "Yash" (without quotes).
Example
Sample Input
2
2
5
Sample Output
Yash
Ninu
Explanation
Test case 1: 2 does not have any odd prime factor, so Ninu cannot make a move and will lose immediately.
Test case 2: N = 5. Ninu can choose p = 5, an odd prime factor of N, and subtract it.
This makes N = 0, and Yash cannot move; making Ninu the winner.
2
2
5
Sample Output
Yash
Ninu
Explanation
Test case 1: 2 does not have any odd prime factor, so Ninu cannot make a move and will lose immediately.
Test case 2: N = 5. Ninu can choose p = 5, an odd prime factor of N, and subtract it.
This makes N = 0, and Yash cannot move; making Ninu the winner.