Submit | All submissions | Best solutions | Back to list |
BASS - BASE FIGHT |
Naruto and SasUke are engaged in their final battle. The result of the battle can be computed mathematically. If the total number of ones in both the Naruto and SasUke power's (absolute value) binary form is even, Naruto wins and if it's odd SasUke wins.
Input
The input consist of series of test cases terminated by 0 0. Each test case will consist two integers m and n (-10^9 <= m, n <= 10^9) as Naruto's and SasUke's powers respectively.
Output
Each line of output must consist of "Naruto Wins :)" if Naruto wins otherwise "SasUke Wins :(" .
Example
Input: 5 6 11 16 0 0 Output: Naruto Wins :) Naruto Wins :)
Added by: | `Ak |
Date: | 2014-10-29 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All |