Sam and Joy like play games. They often play some puzzle game. Today , they have a lots of coins, so they decide to make all coins into many piles. After that, they agreed that one of them can move one or more coins from the one pile, and the man who gets the last coin is the winner. Sam will first move the coins. We think that both of them are very clever, they know the best way to move the coins. Can you know who will win the game?
There are multiple test cases. Each test case contain a number N ( 1 <= N <= 100), Then follow N integers describe the number of coins in every piles.For each test, output who will win the games.
Simple input
1
5
2
2 2
Simple output
Sam
Joy
//水题:按位异或应用
#include<stdio.h>
int main()
{
}