RK and Nakul are playing with M disks stored in a box. They will pick disks turn by turn such that the number of disks picked is a power of four.The person who is unable to pick a valid number of disks is declared a loser. If RK goes first, find the winner of the game if both of them play optimally.

Input format

• First line: T
  
• Each test case: M

Output format

For each test case print "RK", if RK wins, or "Nakul", if Nakul wins

Constraints
1 ≤ T ≤ 1000
1 ≤ M ≤ 10¹⁷