//洛谷P1125.笨小猴 
#include<iostream>
#include<cmath> 
using namespace std;

char ch[100];
char x;
int i;
int num[200];
int maxn=-1,minn=100;


bool zhishu(int n){
	if(n==0 || n==1){
		return false;
	}
	for(int j=2;j<n;j++){
		if(n%j==0){
			return false;//不是质数 
		}
		return true; 
	} 
}


int main()
{
	while( (x=getchar()) != '\n' ){
		ch[i]=x;
		i++;
	}
	for(int k=0;k<=i;k++){
		num[ch[k]]++;
	}
	
	for(int p=97;p<=122;p++){		
		if(num[p]<minn && num[p]!=0){
			minn=num[p];
		}
		if(num[p]>maxn){
			maxn=num[p];
		}
	}
	//cout<<"maxn:"<<maxn<<endl;
	//cout<<"minn:"<<minn<<endl;
	int v=maxn-minn;
	if( zhishu(v)==true ){
		cout<<"Lucky Word"<<endl;
		cout<<v;
	}else{
		cout<<"No Answer"<<endl;
		cout<<0;
	}
	
	return 0;
}