#include <iostream>
#include <string>
#include <algorithm> 

using namespace std;


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

int main() {
    string str;
    cin >> str;

    int maxCount = 0, minCount = INT_MAX;
    int counts[26] = {0}; 


    for (char c : str) {
        if (islower(c)) {
            counts[c - 'a']++;
            maxCount = max(maxCount, counts[c - 'a']);
            if (counts[c - 'a'] > 0) minCount = min(minCount, counts[c - 'a']);
        }
    }

  
    int diff = maxCount - minCount;
    if (diff < 2 || !isPrime(diff)) {
        cout << "No Answer" << endl<<0;
    } else {
        cout << "Lucky Word" << endl;
        cout << diff << endl;
    }

    return 0;
}