E. Division Game
time limit per test
2 seconds
memory limit per test
512 megabytes
input
standard input
output
standard output

An integer $$$n \gt 1$$$ is written on the board. Yvonne and Zara play a game making moves in turns, Yvonne moves first. On each turn, the player can either divide the integer by $$$2$$$ and round down, or divide it by $$$3$$$ and round up. After that, the old number on the board is erased and replaced by the new one.

The winner is the player who first writes the number $$$1$$$ on the board. Who wins if both play optimally?

Input

The first line contains an integer $$$n$$$ ($$$1 \lt n \le 10^{18}$$$).

Output

If Yvonne wins when both play optimally, print "Yvonne".

If Zara wins when both play optimally, print "Zara".

The letters can be uppercase or lowercase.

Examples
Input
2
Output
Yvonne
Input
4
Output
Zara