QwQ：

#include <bits/stdc++.h>
using namespace std;
string s;
int a[200],maxn=INT_MIN,minn=INT_MAX;
bool prime (int n) {
	if (n<2) return false;
	for (int i=2;i*i<=n;i++) 
	  if (n%i==0) return false;
	return true;
}
int main() {
    cin>>s;
    int len=s.size();
    for (int i=0;i<len;i++) a[s[i]-'a'+1]++;
    for (int i=1;i<=len;i++) {
    	maxn=max (maxn,a[i]);
    	minn=min (minn,a[i]);
	}
	if (prime (maxn-minn)) cout<<"Lucky Word\n"<<maxn-minn;
	else cout<<"No Answer\n0";
	return 0;
}