#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; long long box[10009], c, m[109], minn, maxn, i, j, N, b, z[100]; char word[109]; void isPrime() { box[0] = 1, box[1] = 1; for (i = 2; i <= 10009; i++) { if (!box[i]) { for (j = i + i; j <= 10009; j = j + i) { box[j] = 1; } } } } int main(void) { isPrime(); scanf("%lld", &N); for(i=0;i<N;i++){ b = 0; c = 0; scanf("%s", word); for(j=0;j<26;j++){ z[j]=0; } while (word[b] != '\0') { z[word[b] - 'a']++; b++; } for(j=0;j<26;j++){ // printf("第%lld次\n",j+1); // printf("z=%lld\n",z[j]); } minn=99999; maxn=0; while (c < 26) { if (z[c]!=0) { if (z[c] > maxn) { // printf("maxn=%lld\n",maxn); maxn = z[c]; } if (z[c] < minn) { // printf("minn=%lld\n",minn); minn = z[c]; } } c++; } if (!box[maxn - minn]) { printf("Lucky Word\n"); printf("%lld\n",maxn-minn); }else{ printf("No Answer\n"); printf("0\n"); } } }