Taco's Winning Strategy

In this problem, you are given a sequence of n integers. Your task is to determine which player, Yuji or Sato, has a winning strategy based on the sequence.

The rule is as follows: if the sequence contains at least one even number, then Yuji has the winning strategy; otherwise, the winning player is Sato.

Mathematically, let \(E\) be the count of even numbers in the sequence. Then, the result can be expressed as:

[ \text{Result} = \begin{cases} \text{Yuji} & \text{if } E > 0, \ \text{Sato} & \text{if } E = 0. \end{cases} ]

Read the input from stdin and print the output to stdout.

inputFormat

The input consists of two lines:

• The first line contains a single integer n representing the length of the sequence.
• The second line contains n space-separated integers forming the sequence.

You should read the input from stdin.

outputFormat

Output a single line: print Yuji if there is at least one even number in the sequence; otherwise, print Sato.

The output should be written to stdout.

## sample

5
5 2 8 3 14

Yuji