80分求调!

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e3+5;
map<string,ll>mp;
bool check(ll n){
	if(n==1||n==0)return 0; 
	if(n==2)return 1;
	for(ll i=2;i<=sqrt(n)+1;++i){
		if(n%i==0)return 0;
	}return 1;
}
void solve(){
	string s;cin>>s;
	ll maxn=-1;ll minn=100+5;
	if(s.size()==0||s.size()==1){
		cout<<"No Answer\n0";
		return; 
	}
	for(ll i=0;i<s.size();++i){
		string tmp=s.substr(i,1);
		mp[tmp]+=1;
		maxn=max(maxn,mp[tmp]);
		minn=min(minn,mp[tmp]);
	}
	if(check(maxn-minn))cout<<"Lucky Word\n"<<maxn-minn;
	else cout<<"No Answer\n0";
}
int main(){
	ll T=1;
	while(T--)solve();
	return 0;
}