[noip2008 improvement group] stupid monkey

Title Description

Stupid little monkey has a small vocabulary , So every time I do multiple choice questions, I have a headache . But he found a way , It has been proved that , It's a very good way to choose the right option ！

The specific description of this method is as follows ： hypothesis maxn It's the number of letters that appear most frequently in a word ,minn It's the number of letters that appear the least in a word , If maxn-minn It's a prime number , So stupid little monkey thinks it's a Lucky Word, Such a word is probably the right answer .

Input format

A word , Only lowercase letters are possible , And the length is less than $100$.

Output format

There are two lines , The first line is a string , Suppose the input word is Lucky Word, Then output “Lucky Word”, Otherwise output “No Answer”;

The second line is an integer , If the input word is Lucky Word, Output maxn-minn Value , Otherwise output $0$.

Examples #1

The sample input #1

error

Sample output #1

Lucky Word
2

Examples #2

The sample input #2

olympic

Sample output #2

No Answer
0

Tips

【 I/o sample 1 explain 】

word error The letters that appear most in $r$ There is $3$ Time , The letter with the least number of occurrences appeared $1$ Time ,$3-1=2$,$2$ Prime number .

【 I/o sample 2 explain 】

word olympic The letters that appear most in $i$ There is $1$ Time , The letter with the least number of occurrences appeared $1$ Time ,$1-1=0$,$0$ Not prime .

（ The original problem has been corrected ）

noip2008 Improve the first question

/* * @Description: To iterate is human, to recurse divine. * @Autor: Recursion * @Date: 2022-07-03 23:24:38 * @LastEditTime: 2022-07-03 23:46:08 */
#include <bits/stdc++.h>
#define LL long long 
using namespace std;
const int mod = 1e9 + 7;
const int INF = 1e9 + 10;
const int N = 1e6;


bool sushu(int x)
{
    
	if(x==0||x==1) return false;
	if(x==2) return true;
	for(int j=2;j*j<=x;j++)
	{
    
		if(x%j==0) return false;
	}
	return true;
}

int maxn,minn = INF;
string s;
int arr[N];
int sum[N];
int main()
{
    
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> s;

    for(int i = 0;i < s.length();i ++){
    
        sum[s[i] - 'a']++;// Find the number of occurrences of each letter 
    }

    // Find the maximum and minimum 
    for(int i=0;i<26;i++){
    // Traverse 26 Letters 
		if(sum[i]>maxn) maxn=sum[i];// Compare maxn
		if(sum[i]>0&&sum[i]<minn) minn=sum[i];// Compare minn, Only compare the letters that appear 
	}

    int ans = maxn - minn;
    if(sushu(ans))
        cout << "Lucky Word" << endl << ans;
    else 
        cout << "No Answer" << endl << 0;
    return 0;
}