#include <stdio.h>
#include <string.h>
 
int count[27],max,min;
char s[200];
bool notprime[102];
 
int main()
{
	freopen("word.in","r",stdin);
	freopen("word.out","w",stdout);
	gets(s);
	memset(count,0,sizeof(count));
	for (int i=0;s[i];i++)
		count[s[i]-96]++;
	min = 2147483647;
	max = 0;
	for (int i=1;i<=26;i++)
	{
		if (!count[i])
			continue;
		if (max<count[i])
			max = count[i];
		if (min>count[i])
			min = count[i];
	}
	int j;
	notprime[0] = true;
	notprime[1] = true;
	for (int i=2;i<=50;i++)
	{
		j = i*2;
		while (j<=100)
		{
			notprime[j] = true;
			j += i;
		}
	}
	max -= min;
	if (notprime[max])
	{
		printf("No Answer\n");
		max = 0;
	}
	else
		printf("Lucky Word\n");
	printf("%d\n",max);
	return 0;
}

#include <stdio.h>
#include <string.h>
 
int n,ans;
int c[2002]={6,2,5,5,4,5,6,3,7,6};
 
int main()
{
	freopen("matches.in","r",stdin);
	freopen("matches.out","w",stdout);
	scanf("%d",&n);
	for (int i=10;i<=1800;i++)
		c[i] = c[i/10]+c[i%10];
	n -= 4;ans = 0;
	for (int i=0;i<=800;i++)
		for (int j=0;j<=800;j++)
			if (c[i]+c[j]+c[i+j]==n)
				ans++;
	printf("%d\n",ans);
	return 0;
}

#include <stdio.h>
#include <string.h>
 
int a[52][52],f[52][52][52][52],n,m,ni,nj,nk,np;
int next[4][4]={0,-1,-1,0,-1,0,-1,0,0,-1,0,-1,-1,0,0,-1};
 
int main()
{
	freopen("message.in","r",stdin);
	freopen("message.out","w",stdout);
	scanf("%d %d",&n,&m);
	memset(f,0,sizeof(f));
	for (int i=1;i<=n;i++)
		for (int j=1;j<=m;j++)
			scanf("%d",&a[i][j]);
	for (int i=1;i<=n;i++)
		for (int j=1;j<=m;j++)
			for (int k=1;k<=n;k++)
				for (int p=j;p<=m;p++)
					for (int m=0;m<=3;m++)
					{
						ni = i + next[m][0];
						nj = j + next[m][1];
						nk = k + next[m][2];
						np = p + next[m][3];
						if ((ni!=nk)||(nj!=np))
							if (f[i][j][k][p] < f[ni][nj][nk][np] + a[i][j] + a[k][p])
								f[i][j][k][p] = f[ni][nj][nk][np] + a[i][j] + a[k][p];
					}
	printf("%d",f[n][m][n][m]);
	return 0;
}

function RSHash(S: string): Cardinal;
var
  a, b: Cardinal;
  I: Integer;
begin
  Result := 0;
  a := 63689;
  b := 378551;
  for I := 1 to Length(S) do
  begin
    Result := Result * a + Ord(S[I]);
    a := a * b;
  end;
  Result := Result and $7FFFFFFF;
end;

function JSHash(S: string): Cardinal;
var
  I: Integer;
begin
  Result := 1315423911;
  for I := 1 to Length(S) do
  begin
    Result := ((Result shl 5) + Ord(S[I]) + (Result shr 2)) xor Result;
  end;
  Result := Result and $7FFFFFFF;
end;

function PJWHash(S: string): Cardinal;
var
  OneEighth,
  ThreeQuarters,
  BitsInUnignedInt,
  HighBits,
  test: Cardinal;
  I: Integer;
begin
  Result := 0;
  test   := 0;
  BitsInUnignedInt := SizeOf(Cardinal) * 8;
  ThreeQuarters    := BitsInUnignedInt * 3 div 4;
  OneEighth        := BitsInUnignedInt div 8;
  HighBits         := $FFFFFFFF shl (BitsInUnignedInt - OneEighth);
  for I := 1 to Length(S) do
  begin
    Result := (Result shl OneEighth) + Ord(S[I]);
    test   := Result and HighBits;
    if test <> 0 then Result := ((Result xor (test shr ThreeQuarters)) and not HighBits);
  end;
  Result := Result and $7FFFFFFF;
end;

function ELFHash(S: string): Cardinal;
var
  X: Cardinal;
  I: Integer;
begin
  Result := 0;
  X := 0;
  for I := 1 to Length(S) do
  begin
    Result := (Result shl 4) + Ord(S[I]);
    X := Result and $F0000000;
    if X <> 0 then
    begin
      Result := Result xor (X shr 24);
      Result := Result and not X;
    end;
  end;
  Result := Result and $7FFFFFFF;
end;

function BKDRHash(S: string): Cardinal;
var
  seed: Cardinal;
  I: Integer;
begin
  Result := 0;
  seed   := 131;  // 31 131 1313 13131 131313 etc..
  for I := 1 to Length(S) do
  begin
    Result := Result * seed + Ord(S[I]);
  end;
  Result := Result and $7FFFFFFF;
end;

function SDBMHash(S: string): Cardinal;
var
  I: Integer;
begin
  Result := 0;
  for I := 1 to Length(S) do
  begin
    Result := Ord(S[I]) + (Result shl 6) + (Result shl 16) - Result;
  end;
  Result := Result and $7FFFFFFF;
end;

function DJBHash(S: string): Cardinal;
var
  I: Integer;
begin
  Result := 5381;
  for I := 1 to Length(S) do
  begin
    Result := Result + (Result shl 5) + Ord(S[I]);
  end;
  Result := Result and $7FFFFFFF;
end;

function APHash(S: string): Cardinal;
var
  I: Integer;
begin
  Result := 0;
  for I := 1 to Length(S) do
  begin
    if (i and 1) <> 0 then
      Result := Result xor ((Result shl 7) xor Ord(S[I]) xor (Result shr 3))
    else
      Result := Result xor (not (Result shl 11)  xor Ord(S[I]) xor (Result shr 5));
  end;
  Result := Result and $7FFFFFFF;
end;