#include <stdio.h>
typedef struct {
 char p[100][100];
} tpole;

int N;

int dalsidama(tpole pole,int dam,int x,int y)
{
  int i0,i1;
  if (dam>N) return 0;
  for (i0=0;i0<N;i0++) {
    for (i1=0;i1<N;i1++) {
      if (x==i0) pole.p[i0][i1]=1;
      if (y==i1) pole.p[i0][i1]=1;
      if (y-x==i1-i0) pole.p[i0][i1]=1;
      if (y+x==i1+i0) pole.p[i0][i1]=1;
    }
  }

  for (i0=0;i0<N;i0++) {
    for (i1=0;i1<N;i1++) {
      if (pole.p[i0][i1]==0) if ( dalsidama(pole,dam+1,i0,i1)==0 ) return 0; 
    }
  }

  return 1;
}
int radek() 
{  int a,i0,i1;
   tpole pole;
    scanf("%d\n", &a); printf("%d\n",a);
    if (a == 0) return  0; N=a;
    for (i0=0; i0<N; i0++) {
      for (i1=0; i1<N; i1++) {
	pole.p[i0][i1]=0;
      }
    }  
    if (dalsidama (pole,0,-1,-1)==0) printf("Kralovny lze umistit.");
    else printf("Kralovny se nevejdou.");
    return 1;
}

int main() {
   while (radek()) ;
   return 0;
}