#include<iostream>
#include<string>
#include<cmath>
using namespace std;
int a[150] = { 0 };
bool ZS(int num)
{
	if (num == 1)
		return 0;
	if (num == 2)
		return 1;
	for (int i = 2; i < sqrt(num) + 1; i++)
		if ((num % i) == 0)
			return 0;
	return 1;
}
int main()
{
	int max = -10000, min = 10000;
	string s;
	cin >> s;
	for (int i = 0; i < s.size(); i++)
		a[s[i] - '0']++;
	for (int i = 49; i < 75; i++)
	{
		if (a[i] > max)max = a[i];
		if (a[i] < min)min = a[i];
	}
	int flag = 1;
	for (int i = 0; i < s.size()-1; i++)//该步骤是检测s是否全都是同样的字母（如果都是一样会影响min）
		if (s[i] != s[i+1])
			flag = 0;
	if ((min == 0) && (flag == 0))min++;
	int x = max - min;
	if (ZS(x))
		cout << "Lucky Word" << endl << x;
	else
		cout << "No Answer" << endl << 0;
	return 0;
}

大佬们 挂在1和9了 救救我twt