program sadjkhg;
var st:string;
i,j,maxn,minn,fuck:longint;
a:array[1..10000] of longint;
begin
assign(input,'word.in');reset(input);
assign(output,'word.out');rewrite(output);
read(st);
for i:=1 to length(st) do
case st[i] of
'a':a[1]:=a[1]+1;
'b':a[2]:=a[2]+1;
'c':a[3]:=a[3]+1;
'd':a[4]:=a[4]+1;
'e':a[5]:=a[5]+1;
'f':a[6]:=a[6]+1;
'g':a[7]:=a[7]+1;
'h':a[8]:=a[8]+1;
'i':a[9]:=a[9]+1;
'j':a[10]:=a[10]+1;
'k':a[11]:=a[11]+1;
'l':a[12]:=a[12]+1;
'm':a[13]:=a[13]+1;
'n':a[14]:=a[14]+1;
'o':a[15]:=a[15]+1;
'p':a[16]:=a[16]+1;
'q':a[17]:=a[17]+1;
'r':a[18]:=a[18]+1;
's':a[19]:=a[19]+1;
't':a[20]:=a[20]+1;
'u':a[21]:=a[21]+1;
'v':a[22]:=a[22]+1;
'w':a[23]:=a[23]+1;
'x':a[24]:=a[24]+1;
'y':a[25]:=a[25]+1;
'z':a[26]:=a[26]+1;
end;
for j:=1 to 26 do
if a[j]>maxn then maxn:=a[j];
minn:=maxn;
for j:=1 to 26 do
if (a[j]<>0) and (a[j]<minn) then minn:=a[j];
if (maxn-minn)=0 then
begin
writeln('No Answer');
write('0');
exit;
end;
for i:=2 to trunc(sqrt(maxn-minn))+1 do
begin
if (maxn-minn) mod i = 0 then
inc(fuck);
if (fuck>1) or (maxn-minn=1) then
begin
writeln('No Answer');
write('0');
exit;
end;
if fuck<=1 then
begin
writeln('Lucky Word');
write(maxn-minn);
exit;
end;
end;
close(input);close(output);
end.