#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
	int minn, maxn, count, min, max, i;
	string s;
	cin >> s;
	sort(s,s +s.size());
	min = max = s[0];
	minn = 1;
	maxn = 1;
	count = 1;
	for (i = 1;i < s.size();i++)
	{
		if (s[i] == s[i - 1])
			count++;
		else {
			if (count < minn)
			{
				minn = count;
				min = s[i];
			}
			else
			{
				maxn = count;
				max = s[i];
			}
            count=1
		}
	}
	int n = maxn - minn;
	for (i = 2;i <= n;i++)
		if (n % i == 0) break;
	if (i < n)	cout << "Lucky Word" << endl;
	else  cout << "No Answer" << endl;
	cout << n;
	return 0;
}