rt

#include<bits/stdc++.h>
using namespace std;
map <char,int> mp;
bool st[1000];
int a[1000];
int n,b,cnt=0;
void isprime(){
	memset(st,1,sizeof(st));
	st[0]=0,st[1]=0;
	for(int i=2;i<=sizeof(st);i++){
		if(st[i]){
			a[i]=i;
			for(int j=2;j*i<=sizeof(st);j++){
				st[i*j]=0;
				a[i*j]=max(i,a[i*j]);
			}
		}
	}
}
int main(){
	isprime();
	string s;
	cin>>s;
	int maxn=-2e9,minn=2e9;
	for(int i=0;i<s.size();i++){
		if(++mp[s[i]]>maxn) maxn=mp[s[i]];
		if(++mp[s[i]]<minn) minn=mp[s[i]];
	}
	if(st[maxn-minn]){
		cout<<"Lucky Word"<<endl<<maxn-minn;
	}else{
		cout<<"No Answer\n0";
	}
}