#include<bits/stdc++.h>
using namespace std;
int b[26],maxn=INT_MIN,minn=INT_MAX;
string a;
bool zhishu(int n){
	for(int i=2;i<=sqrt(n);i++){
		if(n%i==0) return false;
	}
	return true;
}
int main(){
	cin>>a;
	for(int i=0;i<a.size();i++){
		switch(a[i]){
			case 'a':b[0]++;break;
			case 'b':b[1]++;break;
			case 'c':b[2]++;break;
			case 'd':b[3]++;break;
			case 'e':b[4]++;break;
			case 'f':b[5]++;break;
			case 'g':b[6]++;break;
			case 'h':b[7]++;break;
			case 'i':b[8]++;break;
			case 'j':b[9]++;break;
			case 'k':b[10]++;break;
			case 'l':b[11]++;break;
			case 'm':b[12]++;break;
			case 'n':b[13]++;break;
			case 'o':b[14]++;break;
			case 'p':b[15]++;break;
			case 'q':b[16]++;break;
			case 'r':b[17]++;break;
			case 's':b[18]++;break;
			case 't':b[19]++;break;
			case 'u':b[20]++;break;
			case 'v':b[21]++;break;
			case 'w':b[22]++;break;
			case 'x':b[23]++;break;
			case 'y':b[24]++;break;
			case 'z':b[25]++;break;
		}
	}
	for(int i=0;i<26;i++){
		if(b[i]>maxn) maxn=b[i];
		if(b[i]<minn&&b[i]!=0) minn=b[i];
	}
	if(zhishu(maxn-minn)&&maxn-minn!=0&&maxn-minn!=1) cout<<"Lucky Word"<<endl<<maxn-minn;
	else cout<<"No Answer"<<endl<<maxn-minn;
	return 0;
}