题解（A14.笨小猴）

#include <iostream>
#include <string>
#include <map>
#include <cmath>
using namespace std;
string s;
map <char, int> a;
int n, m = 1000, num;
int f(int x){
if (x <= 1) return 0;
for (int i = 2; i <= sqrt(x); i ++)
if (x % i == 0)
return 0;
return x;
}
int main(){
cin >> s;
for (int i = 0; i < s.size(); i ++){
a[s[i]] += 1;
n = max(n, a[s[i]]);
}
for (char i = 'a'; i <= 'z'; i ++){
if (a[i] != 0)
m = min(a[i], m);
}
num = f(n - m);
if (num) cout << "Lucky Word" << '\n';
else cout << "No Answer" << '\n';
cout << num;
return 0;
}