- 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.
The only input line contains a string of length $n$ that consists of characters H, I and T.
Print the winner of the game – "Uolevi" or "Maija".
- $1 \le n \le 10^6$