It's ICPC time and everyone is preparing for the upcoming online contest , and So is Naruto (Yes !! Naruto will give ICPC this year.).

Naruto has already mastered all the topics for ICPC except Game Theory. So he asks Pervy Sage ( Jiraiya ) , to help him .

Jiraiya is known for his unique methods of teaching and this time is no different. He decides to train Naruto in a unique way , and Sakura is going to help him .

Jiraiya gives Naruto and Sakura a game to play and if Naruto wins the game , he would master game theory also.

Initially Naruto and Sakura are given an N-element sequence, * 2^1 * 2^2 * 2^3 ... * 2^n .

Naruto and Sakura takes alternating turns, with Naruto always moving first. During each move, the current player can chose an asterisk (*) and turn it into a positive (+) opr a negative(-) sign.

The game ends when all the asteriks (*) are converted to either a positive or a negative sign. At the end of the game the final value of the sequence is calculated. If the final result is divisible by 17 , then Sakura wins , otherwise Naruto wins.

Given the value of N , help Naruto to decide if he can win the game or not . Assume both Naruto and Sakura play optimally.

Input :

The first line of input contains an integer T , denoting the no of test cases.

Each of the next T lines contains a single integer N.

Output :

For each test case print "Naruto" (Without quotes) if Naruto will win the game , or "Sakura"(Without quotes) if Sakura wins.

Constraints :

1 <= T, N <= 1000000