x should never be equal to the current value of 'N'.
The first line of the input contains an integer 'T' denoting the number of test cases. The first and the only line of each test case contains an integer 'N' as described in the problem statement.
For each test case, return 1, if “Ninja 1”, wins the game, otherwise return 2 if "Ninja 2" wins the game.
You don't need to print anything, it has already been taken care of. Just implement the given function.
1 <= T <= 10^5 1 <= N <= 10^9 Time limit: 1 sec
Merge Two Sorted Arrays Without Extra Space
Ninja And The Strictly Increasing Array