如题，如图，好家伙，求$dalao$帮忙救救孩子

#include<iostream>
using namespace std;
int pr[] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,0x7f};
bool prime(int i)
{	int p = 0;
	while(pr[p] < i)p++;
	if(pr[p] == i) return true;
	return false;
}
int op[26];
int main()
{
	string error;
	cin >> error;
	for(int i = 0;i < error.size();i++)
		op[error[i] - 'a']++;
	int mi = 0x7f,mx;
	for(int i = 0;i < 26;i++)
		mi = min(mi,op[i] ? op[i] : 0x7f),mx = max(mx,op[i]);
	if(prime(mx-mi))
		cout << "Lucky Word\n" << mx - mi << endl;
	else
		cout << "No Answer\n0" << endl;
}