#include<bits/stdc++.h>
using namespace std;
bool isprime(int n){
	if(n<=1) return 0;
	for(int i=2; i<=sqrt(n); i++){
		if(!(n%i)) return false;
	}
	return true;
}
int main(){
    int maxn=0, minn=110, times[26];
    string a;
    for(int i=0; i<a.length(); i++){
        times[a[i]-'a']++;
    }
    for(int i=0; i<26; i++){
        if(times[i]>maxn) maxn=times[i];
        if(times[i]&&times[i]<minn) minn=times[i];
    }
    if(!isprime(maxn-minn)) cout<<"No Answer"<<endl<<0;
    else cout<<"Lucky Word"<<endl<<maxn-minn;
    return 0;
}