#include<bits/stdc++.h>
using namespace std;
int k(int n){
	int a[25]{2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97};
	for(int i=0;i<25;i++){
		if(n==a[i]){
			return 1;
		}
	}
	return 2;
}
char s[110];
int a[190];
int main(){
	int maxn=0,minn=101;
	scanf("%s",s);
	int u=strlen(s);
	for(int i=0;i<u;i++){
		a[toascii(s[i])]++;
	}
	sort(a,a+190);
	for(int i=0;i<190;i++){
		if(a[i]>=1){
			if(a[i]>maxn){
				maxn=a[i];
			}
			if(a[i]<minn){
				minn=a[i];
			}
		}
	}
	if(maxn==minn){
		cout<<"No Answer"<<endl;
		cout<<0;
	}
	int l=maxn-minn;
	if(k(l)==1){
		cout<<"Lucky Word"<<endl;
		cout<<l;
	}else{
		cout<<"No Answer"<<endl;
		cout<<0;
	}
	return 0;
}

我是蒟蒻