#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
	int m=0, l = 0, k[10001] = {0};
	string s;
	cin >> s;
	l = s.length();
	for (int i = 0; i < l; i++)
	{
		for (int j = 0; j < l&&j!=i; j++)
		{
			if (s[i] == s[j])k[i]++;
		}
	}
	sort(k, k + l);
	m = k[l - 1] - k[0];
	int flag = 0;
	if (m == 0||m==1)
	{
		cout << "No" << ' ' << "Answer"<<endl;
        cout<<0;
	}
    else if(m==2)
    {
            	cout << "Lucky" << ' ' << "Word" << endl;
			cout << m;
    }
	else
	{
		for (int i = 2; i <= sqrt(m); i++)
		{
			if (m % i == 0)
			{
				flag = 1;
			}
		}
		if (flag == 0)
		{
			cout << "Lucky" << ' ' << "Word" << endl;
			cout << m;
		}
		else
		{
			cout << "No" << ' ' << "Answer"<<endl;
            cout<<0;
		}
	}
	return 0;
}