#include <iostream>
#include <map>
using namespace std;
#define endl '\n'
int maxn = 1, minn = 1;

bool check(int n) { //质数筛
    bool isPrime = true;
    if (n <= 1) isPrime = false;
    for (int i = 2; i * i <= n; i++){
        if (n % i == 0) isPrime = false;
    }
    return isPrime;
}

int main() {
    string s;
    cin >> s;
    map<char, int> p;
    for (char ch: s){
        p[ch]++;
    }
    for (auto i = p.begin(); i != p.end(); i++){
        if (i->second >= maxn) maxn = i->second;
        if (i->second <= minn) minn = i->second;
    }
    if (check(maxn - minn)){
        cout << "Lucky Word" << endl << maxn - minn;
    } else{
        cout << "No Answer" << endl << '0';
    }

    return 0;
}