Both our Shuklas are playing an intense game today. At the start of this game, Shikhar, the referee gives them a string, made of lowercase latin alphabets. Both our Shuklas play this game alternatively. In any turn, if a player could rearrange the string in such a way that the newly formed string is palindrome, then that player wins. If that player cannot rearrange it to form a palindrome, he has to remove one character from the string.

Shukla 1 starts the game. Help Shikhar determine whether which Shukla will win on a particular string if both play optimally.

INPUT:

The input consists of one string only consosting of lowercase latin letters.

OUTPUT:

Print "Shukla 1 wins"(without quotes) if the player starting the game wins, else print "Shukla 2 wins"(without quotes).

CONSTRAINTS:

1 <= length of string <= 100000

EXAMPLES:

Input #1:

aba

Output #1:

Shukla 1 wins

Input #2:

abac

Output #2:

Shukla 2 wins