这小猴也太笨了

#include <bits/stdc++.h>
using namespace std;
map<char, int> mp;
bool prime(int x){
    if(x <= 1) return false;
    else if(x == 2) return true;
    else for(int i = 2; i <= x / 2; i++){
        if(x % i == 0) return false;
    }
    return true;
}
int main(){
    string s;
    cin >> s;
    for(int i = 0; i < s.size(); i++){
        mp[s[i]]++;
    }
    int maxn = -0xff;
    int minn = 0xff;
    for(auto it : mp){
        maxn = max(maxn, it.second);
        minn = min(minn, it.second);
    }
    if(prime(maxn - minn)){
        cout << "Lucky Word\n";
        cout << maxn - minn;
    }
    else cout << "No Answer\n0";
    return 0;
}