#include <iostream>
using namespace std;

int ww[]={0,0,1,0,1};
int pp[]={0,0,1,2,3};
int path(int x){
	if(x<4)
		return pp[x];
	return x/2 + (x%4!=2);
}

bool win(int x){
	if(x<4)
		return ww[x];
	return x%4!=3;
}
int n,a[200005],w;
int main() {
	// for(int i=1; i<15; ++i){
	// 	cout<<i<<":\t"<<(win(i)?"W":"L")<<"\t"<<path(i)<<endl;
	// }
	cin>>n;
	for(int i=0; i<n; ++i){
		cin>>a[i];
		if(win(a[i]))
			w = max(w,a[i]);
	}
	if(w==0){
		cout<<"Mike\n";
		return 0;
	}
	for(int i=0; i<n; ++i){
		if(path((a[i]+1)/2) >= path(w)){
			cout<<"Mike\n";
			return 0;
		}
	}
	cout<<"Constantine\n";
	return 0;
}