noip---笨小猴

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
string s; int minn=10000,A[30];
 bool zhishu(int x)
{
	if(!x || x==1) return false;
	if(x==2) return true;
	for(register int a=2;a*a<=x;++a)
	if(x%a==0) return false; 
	return true;
}
int main(void)
{
		cin>>s;
		int len=s.size();
		for(register int a=0;a<len;a++)
		A[s[a]-'a']++;
		sort(A,A+26);
		int maxn=A[25];
		for(register int a=0;a<26;a++)
		if(A[a]<minn && A[a] !=0)
		minn=A[a];
		if(zhishu(maxn - minn))  printf("Lucky Word\n%d",maxn-minn);
		else  printf("No Answer\n0");
		return 0;
}