#include <stdio.h>
//P1125
#include <math.h>
int isprime(int n)
{
	if (n <= 1 || n != 2 && n % 2 == 0)
	{
		return 0;
	}
	int i;
	for (i = 3; i <= sqrt(n); i += 2)
	{
		if (n % i == 0)
		{
			return 0;
		}
	}
	return 1;
}
int main()
{
	int a[26];
	for (int i = 0; i < 26; i++)
	{
		a[i] = 0;
	}
	int max, min;
	char b[100];
	scanf("%s", &b);
	int i = 0;
	while (b[i])
	{
		a[b[i] - 97]++;
		i++;
	}
	max = a[0]; min = 100;
	int j = 0;
	for (j = 0; j < 26; j++)
	{
		if (max < a[j])
		{
			max = a[j];
		}
		if (min > a[j] && a[j] != 0)
		{
			min = a[j];
		}
	}
	int t = max - min;
	if (isprime(t) == 1)
	{
		printf("Lucky Word\n%d", t);
	}
	else
	{
		printf("No Answer\n%d", t);
	}
	return 0;
}