- Time limit: 1.00 s
- Memory limit: 512 MB
You are given the initial string, and your task is to find out who will win the game if both players play optimally.
Input
The only input line contains a string of length $n$ that consists of characters H, I and T.
Output
Print the winner of the game – "Uolevi" or "Maija".
Constraints
- $1 \le n \le 10^6$
Input:
HIHIITIT
Output:
Maija