纯题解：

#include<bits/stdc++.h>
using namespace std;

int prime(int x){
	for(int f=2;f<x;f++){
		if(x%f==0){
			return 0;
		}
	}
	return 1;
}

int main(){
	int maxn=0,minn=105,c;
	string word;
	cin>>word;
	for(int i=0;i<word.size();i++){
		c=std::count(word.begin(),word.end(),word[i]);
		if(c>maxn){
			maxn=c;
		}
		else if(c<minn){
			minn=c;
		}
	}
	
	if(maxn-minn==0 || maxn-minn==1 || prime(maxn-minn)==0){
		cout<<"No Answer"<<endl;
		cout<<"0";
	}
	
	else if(prime(maxn-minn)){
		cout<<"Lucky Word"<<endl;
		cout<<maxn-minn;
	}
return 0;
}