【2008NOIP提高组】T1 笨小猴

P1125 笨小猴
题目传送门

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include<vector>
#define fre(x) freopen(#x".in","r",stdin),freopen(#x".out","w",stdout);
using namespace std;
const int MAX=2147483647;
const int N=1e6;
string s;
int f[30],maxn=0,minn=MAX;
bool check(int x)
{
	if(x<2) return 0;
	if(x==2) return 1;
	for(int i=2;i*i<=x;i++) if(x%i==0) return 0;
	return 1;
}
int main()
{
	//fre();
	cin>>s;
	int len=s.size();
	for(int i=0;i<len;i++) f[s[i]-'a']++;
	for(int i=0;i<26;i++) 
		if(f[i]) maxn=max(f[i],maxn),minn=min(f[i],minn);
	if(check(maxn-minn)) cout<<"Lucky Word"<<endl<<maxn-minn<<endl;
	else cout<<"No Answer"<<endl<<0<<endl;
	return 0;
}