A14.笨小猴

#include<iostream>
#include<cmath>
using namespace std;
bool prime(int n){
	if(n<2) return 0;
	for(int i=2;i<=sqrt(n);i++)
		if(n%i==0)
			return 0;
	return 1;
}
int main(){
	int t[26]={0},maxn=0,minn=100;
	string s;
	cin>>s;
	for(int i=0;i<s.length();i++)
		t[s[i]-'a']++;
	for(int i=0;i<26;i++){
		if(t[i]>maxn) maxn=t[i];
		if(t[i]<minn&&t[i]>0) minn=t[i];
	}
	if(prime(maxn-minn))
		cout<<"Lucky Word\n"<<maxn-minn;
	else
		cout<<"No Answer\n0";
	return 0;
}