Problem Description

Iori's latest obsession is pyramids.

Iori received a model of a pyramid as a birthday present. She and her close friend Yayoi play a game using the pyramid model as follows:

• Arrange $ N $ pyramids in a row. Each pyramid $i\ (1\ ≦\ i\ ≦\ N)$ has $ A_i $ stones stacked on it.
• The two players take turns performing one of the following actions. Iori is the first player, and Yayoi is the second player.
• Remove one stone from any one pyramid.
• Remove one stone from all $ N $ pyramids. This action can only be performed if all pyramids have at least one stone remaining.
• The player who cannot perform an action loses the game, and the other player wins.

When both players aim to win and take optimal actions, which player will win?

Input Format

The input is given from the standard input in the following format:

$ N $ $ A_1 $ $ A_2 $ ... $ A_N $

• The first line contains an integer $N\ (1\ ≦\ N\ ≦\ 50)$, representing the number of pyramids.
• The second line contains $ N $ integers $A_i\ (1\ ≦\ A_i\ ≦\ 50)$, representing the number of stones stacked on each pyramid, separated by spaces.

Output Format

Output Iori if the first player wins, or Yayoi if the second player wins. End the output with a newline.

Sample Input and Output

Sample Input #1

2
1 1

Sample Output #1

Iori

Sample Input #2

1
50

Sample Output #2

Yayoi

Notes/Hints

Sample Explanation 1

If Iori takes both stones, Yayoi cannot take any stones, resulting in Iori's victory. Note that the string "Iori" is the Romanized form of "伊織" and does not mean "I or i".

见题面 Input 部分

见题面 Output 部分