LINIJE

#include<cstdio>
#include<vector>
#include<string.h>
#include<algorithm>
#include <iomanip>

#define sc scanf
#define pr printf
#define fr first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
const int MN = 510;
const int INF = 10000010;
const double eps = 1e-12;

int n, x, y;
bool u[MN+MN];
vector<int>g[MN+MN], s;

bool dfs(int v){
    u[v] = true;
    for(int i=0; i<g[v].size(); i++){
        if(!u[ g[v][i] ]){
            if(dfs( g[v][i] ) == true){
                return false;
            }
        }
    }
    return true;
}

int main(){
    freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
    for(sc("%d", &n); n--; ){
        sc("%d%d", &x, &y);
        y += MN;
        s.pb(x);
        s.pb(y);
        g[x].pb(y);
        g[y].pb(x);
    }
    sort(s.begin(), s.end());
    int k = 1;
    for(int i=1; i<s.size(); i++){
        if(s[i] != s[i-1]){
            s[k++] = s[i];
        }
    }
    for(int i=0; i<k; i++){
        if(dfs( s[i] ) == true){
            pr("Mirko\n");
            return 0;
        }
        for(int j=0; j<k; j++){
            u[ s[j] ] = false;
        }
    }
    pr("Slavko\n");
    return 0;
}