1116 Come on Let‘s C

#include<iostream>
#include<vector>
using namespace std; 
bool isPrime(int x){
	if(x==1)
		return false;
	for(int i=2;i*i<=x;i++)
		if(x%i==0)
			return false;
	return true;
}
struct node{
	string ID;
	string reward;
	bool isvisit=false;
}N[100001];
int main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		int temp;
		string s;
		cin>>s;
		temp=stoi(s);
		N[temp].ID=s;
		if(i==1)	
			N[temp].reward="Mystery Award";
		else if(isPrime(i))
			N[temp].reward="Minion";
		else
			N[temp].reward="Chocolate";
	}
	int K;
	cin>>K;
	for(int j=0;j<K;j++){
		int temp;
		string s;
		cin>>s;
		temp=stoi(s);
		cout<<s<<":";
		if(N[temp].reward.size()==0)
			cout<<" Are you kidding?";
		else if(N[temp].isvisit)
			cout<<" Checked";
		else{
			cout<<" "<<N[temp].reward;
			N[temp].isvisit=true;
		}			
		if(j!=K-1)
			cout<<endl;
	}
	return 0;
}