#include <bits/stdc++.h>
using namespace std;
bool isprime(int x) {
	if(x <= 1)
		return false;
	if(x == 2)
		return true;
	for (int i = 2; i * i <= x; i++)
		if(x % i == 0)
			return false;
	return true; 
}
const int N = 1e6;
char a[N];
int b[N] = {0};
int main() {
	scanf("%s", a);
	int len = strlen(a);
	for (int i = 0; i <= len; i++)
		b[(int)a[i] - 'a' + 1]++;
	sort(a, a + len, greater<int>());
	int ans = b[0] - b[1];
	if(isprime(ans) == true) {
		printf("Lucky Word\n%d", ans);
		return 0;
	}
	printf("No Answer\n0");
    return 0;
}