Our heroes, Mirko and Slavko, plant Christmas wheat every year on Saint Lucy’s Day. It is well known that stalks of wheat grow at different speeds so, after a certain time, the wheat becomes quite messy. The guys are determined to solve this problem by playing the following game:

• When it’s Mirko’s turn, he chooses a stalk of wheat with the minimal height and prolongs its height so it’s of the same height as the first stalk longer than it.
• When it’s Slavko’s turn, he chooses a stalk of wheat with the maximal height and cuts it to be of the same height as the first stalk shorter than it.
• The game lasts while there are at least three stalks of different heights and the loser is the player who can’t make his move.

입력

• The first line of input contains the integer N (1 <= N <= 10^5), the number of wheat stalks.
• The second line of input contains N space separated integers that denote the heights of individual wheat stalks. The height of each stalk will be less than or equal to 10^5

출력

• The first line of output must contain the word “Mirko” if Mirko is the winner of the game, or “Slavko” if Slavko is the winner of the game.
• The second line of output must contain the height of the shortest and longest stalk when the game is finished.

입출력 예

입력

3
3 3 3

출력

Slavko
3 3

입력

4
3 1 2 1

출력

Slavko
1 2

입력

7
2 1 3 3 5 4 1

출력

Slavko
2 3

Clarification of the first example: Mirko can’t make his move because there are no three stalks of different
heights. Therefore, Slavko is the winner.

출처:2013/2014 contest4 2/6