Mirko and his faithful friend Slavko got really bored one day. The result of their boredom is the creation of a new game! In the beginning of the game, they draw $N$ points in a coordinate system. The players take turns and Mirko plays first. He draws a straight line which is parallel to one of the axes of the coordinate system and passes through one of the $N$ points. In the following moves, the player draws a straight line which is parallel to one of the axes of the coordinate system and passes through one of the $N$ points located on the line drawn in the previous move of the opponent. No single line must be drawn twice. The loser is the player who cannot play his move. Determine who has the winning strategy.

-----Input-----
The first and only line of input contains the positive integer $N$ ($1 \leq N \leq 10000$). Each of the following $N$ lines contains two integers $X$ and $Y$, the coordinates of the points drawn ($1 \leq X,Y \leq 500$).

-----Output-----
The first and only line of output must contain the name of the winner, either “Mirko” or “Slavko”.

-----Examples-----
Sample Input:
3
1 1
1 2
1 3
Sample Output:
Mirko

Source: kattis | Difficulty: HARD


Solutions: