#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
bool isPrime(int num) {
    if (num <= 1) return false;
    if (num == 2) return true;
    if (num % 2 == 0) return false;
    for (int i = 3; i * i <= num; i += 2) {
        if (num % i == 0) return false;
    }
    return true;
}
int main() {
    string word;
    cin >> word;
    int count[26] = {0};
    for (char c : word) {
        count[c - 'a']++;
    }
    int maxn = 0, minn = 100;  
    for (int i = 0; i < 26; i++) {
        if (count[i] > 0) { 
            maxn = max(maxn, count[i]);
            minn = min(minn, count[i]);
        }
    }
    int diff = maxn - minn;
    if (isPrime(diff)) {
        cout << "Lucky Word" << endl;
        cout << diff << endl;
    } else {
        cout << "No Answer" << endl;
        cout << 0 << endl;
    }
    return 0;
}