代码如下：

#include<bits/stdc++.h>
using namespace std;
int n,minn = 100,maxn = 0,as[26];
bool zhishu(int x){
	if (x == 1 || x == 0){
		return false;
	}
	for (int i = 2;i <= sqrt(x);i++){
		if (x % i == 0){
			return false;
		}
	}
	return true;
}
int main(){
	string a;
	cin >> a;
	n = a.size() - 1;
	for (int i = 0;i <= n;i++){
		as[a[i] - 97]++;
		if (as[a[i] - 97] > maxn){
			maxn = as[a[i] - 97];
			continue;
		}
		if (as[a[i] - 97] < minn){
			minn = as[a[i] - 97];
		}
	}
	cout << (zhishu(maxn - minn) ? "Lucky Word" : "No Answer") << endl;
	cout << (zhishu(maxn - minn) ? maxn - minn : 0);
    return 0;
}