测试点#2和#9不对

#include <bits/stdc++.h>
using namespace std;
int maxn=0,minn=200,b[26]={0};
bool isprime(int x)
{
	if(x<2)
	{
		return false;
	}
	else
	{
		for(int i=2;i<x;i++)
		{
			if(x%i==0)
			{
				return false;
			}
		}
		return true;
	}
}
int main()
{
	char word[101];
	cin>>word;
	int len=strlen(word);
	for(int i=0;i<len;i++)
	{
		b[word[i]-'a']++;
	}
	for(int i=0;i<26;i++)
	{
		if(b[i]>maxn){
			maxn=b[i];
		}
		if(b[i]<minn)
		{
			minn=b[i];
		}
	}
	int p=maxn-minn-1;
	if(isprime(p)==true)
	{
		cout<<"Lucky Word"<<endl<<p;
	}
	else
	{
		cout<<"No Answer"<<endl<<0;
	}
	return 0;
 }