#include<cstdio>
#include<cstdlib>
#include<algorithm>
int n,i,j,k,I,J,la,lb,N[111111];
long long a,b,A,B;
int main()
{
	for(scanf("%d",&n);i<n;scanf("%d",N+i++));
	std::sort(N,N+n--);
	if(N[i=a=b=0]!=N[j=la=lb=n])for(;;)
	{
		if(la){for(la=0,I=i;N[++I]==N[i];);A=a+I;}
		if(lb){for(lb=0,J=j;N[--J]==N[j];);B=b+n-J;}
		if(N[J]<N[I])break;
		B<A?(b=B,lb=1,j=J):(a=A,la=1,i=I);
	}
	printf("%sko\n%d %d\n",a<=b?"Slav":"Mir",N[i],N[j]);
	return 0;
}

I2luY2x1ZGU8Y3N0ZGlvPgojaW5jbHVkZTxjc3RkbGliPgojaW5jbHVkZTxhbGdvcml0aG0+CmludCBuLGksaixrLEksSixsYSxsYixOWzExMTExMV07CmxvbmcgbG9uZyBhLGIsQSxCOwppbnQgbWFpbigpCnsKCWZvcihzY2FuZigiJWQiLCZuKTtpPG47c2NhbmYoIiVkIixOK2krKykpOwoJc3RkOjpzb3J0KE4sTituLS0pOwoJaWYoTltpPWE9Yj0wXSE9TltqPWxhPWxiPW5dKWZvcig7OykKCXsKCQlpZihsYSl7Zm9yKGxhPTAsST1pO05bKytJXT09TltpXTspO0E9YStJO30KCQlpZihsYil7Zm9yKGxiPTAsSj1qO05bLS1KXT09TltqXTspO0I9YituLUo7fQoJCWlmKE5bSl08TltJXSlicmVhazsKCQlCPEE/KGI9QixsYj0xLGo9Sik6KGE9QSxsYT0xLGk9SSk7Cgl9CglwcmludGYoIiVza29cbiVkICVkXG4iLGE8PWI/IlNsYXYiOiJNaXIiLE5baV0sTltqXSk7CglyZXR1cm4gMDsKfQ==

NwoyIDEgMyAzIDUgNCAx

7
2 1 3 3 5 4 1