#include<bits/stdc++.h>
using namespace std;
char s[100];
int prime[100],vis[100],sum;
struct answer{
	int cnt=0;
	char word;
};
bool cmp(const answer &a,const answer &b){
	return a.cnt>b.cnt;
}
int main(){
	answer times[200];
	scanf("%s",s);
	int len=strlen(s);
	for(int i=2;i<10;i++){
		for(int j=i*2;j<=100;j+=i){
			if(!prime[j]){
			prime[j]=1;
			}			
		}
	}
	prime[0]=1;
	prime[1]=1;
	for(int i=0;i<len;i++){
		if(!vis[s[i]])vis[s[i]]=1,sum++;
		times[s[i]].cnt++;
		times[s[i]].word=s[i];
	}
	sort(times,times+200,cmp);
	int mm=times[0].cnt-times[sum-1].cnt;
	if(!prime[mm]){
		printf("Lucky Word\n");
	}
	else{
		printf("No Answer\n");
	}
	printf("%d",mm);
}