Uolevi and Maija are playing the game King's stones, where there are initially n stones on the board. The game starts with Uolevi removing any even number of stones from the board (possibly zero), and if there are no stones on the board afterwards, Uolevi wins. Otherwise, Maija gets to add any number of stones to the board (possibly zero). This process repeats for a total of three rounds, and if Uolevi hasn't won by the end of the game, Maija wins. If both players play optimally, who is the winner of the game?

Input

The only line of the input contains n, the initial number of stones.

Output

Output either "Uolevi" or "Maija" depending on which of them wins the game if both play optimally.

Constraints

• 1 \le n \le 10^5

Examples

Input:

4

Output:

Uolevi

Input:

1

Output:

Maija