#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <climits>
#include <cassert>
#include <set>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#define ll long long
#define ull unsigned long long
//#define int ull
#define re register
#define rep(i,a,b) for(re int i(a);i <= b;i ++)
#define Rep(i,a,b) for(re int i(a);i <= b;i ++)
using namespace std;
inline int read(){
	int x = 0,f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9'){
		if(ch == '-') f = -1;
		ch = getchar();
	}
	while(ch >= '0' && ch <= '9'){
		x = x * 10 + ch - '0';
		ch = getchar();
	}
	return x * f;
}
const int M = 10001;
bool vis[M];
int p[M];
int cnt;
bool chk[M];
inline void oula(){
    rep(i,2,M){
        if(!vis[i]) p[++ cnt] = i,chk[i] = 1;
        for(re int j(1);i * p[j] <= M;j ++){
            vis[i * p[j]] = 1;
            if(i % p[j] == 0) break;
        }
    }
}
string s;
int rcd[10001];
signed main(){
    chk[1] = 0;
    chk[0] = 0;
    chk[2] = 1;
    oula();
    int maxx = 0;
    int minn = INT_MAX;
    cin >> s;
    int l = s.size();
    rep(i,0,l){
        rcd[s[i] - 'a'] ++;
        maxx = max(maxx,rcd[s[i] - 'a']);
        minn = min(minn,rcd[s[i] - 'a']);
    }
    if((maxx - minn) < 0) {
        cout << "No Answer" << endl;
        cout << 0;
        return 0;
    }
    if(chk[maxx - minn]) {
        cout << "Lucky Word" << endl;
        cout << maxx - minn;
        return 0;
    }
    else{
        cout << "No Answer" << endl;
        cout << 0;
        return 0;
    }
}

救.......

哪位大佬帮帮

全RE