E. Esteche vs Yvens
time limit per test
0.25 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Yvens and Esteche play the following game with a pile of $$$n$$$ stones.

They take turns, starting with Yvens, and on each turn, the current player must make one of two moves:

  • Remove one stone from the pile.
  • Remove two stones from the pile.

The player who removes the last stone loses the game.

Given the initial number of stones $$$n$$$, determine who has a winning strategy, assuming both play perfectly.

Input

The input consists of a single line containing an integer $$$n$$$ ($$$1 \leq n \leq 10^9$$$), the initial number of stones in the pile.

Output

Print Yvens if Yvens has a winning strategy, or Esteche otherwise.

Examples
Input
1
Output
Esteche
Input
2
Output
Yvens