#include <iostream>
#include <string>
using namespace std;

bool prime(int a)
{
    if(a == 1)
    {
        return false;
    }
    for(int i = 2;i * i <= a;i++)
    {
        if(a % i == 0)
        {
            return false;
        }
    }
    return true;
}

int max(int a,int b)
{
    if(a > b)
    return a;
    return b;
}

int min(int a,int b)
{
    if(a < b)
    return a;
    return b;
}

int many[27];

int main()
{
    string s;
    cin >> s;
    int maxn=-1e9,minn=1e9;
    for(int i = 0;i < s.size();i++)
    {
        many[s[i] - 'a' + 1] ++;
    }
    for(int i = 1;i <= 26;i++)
    {
        if(many[i] != 0)
        {
        maxn = max(maxn,many[i]);
        minn = min(minn,many[i]);
        }
    }
    int sc=maxn-minn;
    if(prime(sc))
    {
        cout << "Lucky Word" << endl;
        cout << sc;
    }
    else
    {
        cout << "No Answer" << endl << 0;
    }
    
    return 0;
}

有一个测试wa了