#include<iostream>
#include<iomanip>
#include<cmath>//处理根号
#include<set>
using namespace std;
int ran[10001];
//判断是否为素数
bool isPrime(int a){
if(a<=1){
return false;
}
int sqrtNum=static_cast<int>(sqrt(a));
for(int i=2;i<=sqrtNum;i++){
if(a%i==0){
return false;
}
}
return true;
}
int main(){
int n,k;
cin>>n;
for(int i=0;i<n;i++){
int id;
cin>>id;
ran[id]=i+1;
}
cin>>k;
set<int>checked;
for(int i=0;i<k;i++){
int id;
cin>>id;
cout<<setw(4)<<setfill('0')<<id<<": ";
//检查id是否存在
if(ran[id]==0){
cout<<"Are you kidding?"<<endl;
continue;
}
//检查是否已经出现过
if(checked.find(id)!=checked.end()){
cout<<"Checked"<<endl;
continue;
}else{
checked.insert(id);
}
if(ran[id]==1){
cout<<"Mystery Award"<<endl;
}else if(isPrime(ran[id])){
cout<<"Minion"<<endl;
}else{
cout<<"Chocolate"<<endl;
}
}
return 0;
}