#include<iostream>
#include<string>
#include<cmath>
#include<algorithm>
using namespace std;
int f[1000]={0};
bool isprime(int x)
{
     if (x<2) return false;
     for (int i=2;i<x;i++)
         if (x%i==0)
            return false;
     return true;
}
int main()
{
    int ans;
    string n;
    f[26]=0;
    cin>>n;
    int ma=-1000,mi=1000;
    for (int i=0;i<n.size();i++) f[n[i]-'a']++;
    for (int i=0;i<26;i++)if (f[i]>0) {ma=max(ma,f[i]);mi=min(mi,f[i]);}
    ans=ma-mi;
    if (isprime(ans)) {cout<<"Lucky Word"<<endl;cout<<ans;}
    else {cout<<"No Answer"<<endl;cout<<0;};
    return 0;
}

/**************************************************************
	Problem: 2280
	User: admin
	Language: C++
	Result: Accepted
	Time:51 ms
	Memory:2080 kb
****************************************************************/