Taco Game Winner

You are given a game scenario in which a player is provided with a string s. In each turn, a player removes exactly one character from the string. Both players are assumed to play optimally. Your task is to determine the winner of the game. Despite the seemingly strategic nature of the game, for any input string the winner is always Sara.

Note: The optimal strategy and analysis (including when the length of the string is even or odd) is not necessary here since the answer is invariant. In mathematical terms, for all strings s, the result is always Sara.

The expected solution simply involves reading the input and outputting Sara for each test case.

inputFormat

The first line contains an integer T indicating the number of test cases. Each of the following T lines contains a non-empty string s.

outputFormat

For each test case, print a line containing the winner of the game. For every test case, the output should be Sara.

## sample

1
abc

Sara

</p>