#include <bits/stdc++.h>
using namespace std;
int nxt[19][3];
void prepare() {
  nxt[0][0] = 1;
  nxt[0][1] = 4;
  nxt[0][2] = 3;
  nxt[1][0] = 2;
  nxt[1][1] = 5;
  nxt[1][2] = 4;
  nxt[2][0] = -1;
  nxt[2][1] = 6;
  nxt[2][2] = 5;
  nxt[3][0] = 4;
  nxt[3][1] = 8;
  nxt[3][2] = 7;
  nxt[4][0] = 5;
  nxt[4][1] = 9;
  nxt[4][2] = 8;
  nxt[5][0] = 6;
  nxt[5][1] = 10;
  nxt[5][2] = 9;
  nxt[6][0] = -1;
  nxt[6][1] = 11;
  nxt[6][2] = 10;
  nxt[7][0] = 8;
  nxt[7][1] = 12;
  nxt[7][2] = -1;
  nxt[8][0] = 9;
  nxt[8][1] = 13;
  nxt[8][2] = 12;
  nxt[9][0] = 10;
  nxt[9][1] = 14;
  nxt[9][2] = 13;
  nxt[10][0] = 11;
  nxt[10][1] = 15;
  nxt[10][2] = 14;
  nxt[11][0] = -1;
  nxt[11][1] = -1;
  nxt[11][2] = 15;
  nxt[12][0] = 13;
  nxt[12][1] = 16;
  nxt[12][2] = -1;
  nxt[13][0] = 14;
  nxt[13][1] = 17;
  nxt[13][2] = 16;
  nxt[14][0] = 15;
  nxt[14][1] = 18;
  nxt[14][2] = 17;
  nxt[15][0] = -1;
  nxt[15][1] = -1;
  nxt[15][2] = 18;
  nxt[16][0] = 17;
  nxt[16][1] = -1;
  nxt[16][2] = -1;
  nxt[17][0] = 18;
  nxt[17][1] = -1;
  nxt[17][2] = -1;
  nxt[18][0] = -1;
  nxt[18][1] = -1;
  nxt[18][2] = -1;
}
int f[1 << 19];
bool buf[30];
int calc(int s) {
  if (f[s] != -1) return f[s];
  for (int i = 0; i < (19); i++)
    if (s & 1 << i) {
      int ss = s ^ (1 << i);
      if (!calc(ss)) return f[s] = 1;
      for (int j = 0; j < (3); j++) {
        int x = 0;
        for (int k = nxt[i][j]; ~k; k = nxt[k][j]) {
          if (!(ss & 1 << k)) break;
          x |= 1 << k;
          if (!calc(ss ^ x)) return f[s] = 1;
        }
      }
    }
  return f[s] = 0;
}
int main() {
  prepare();
  char c;
  int p = 0;
  while (scanf("%c", &c) == 1)
    if (c == '.' || c == 'O') buf[p++] = (c == 'O');
  buf[p] = 0;
  p = 0;
  int s = 0;
  for (int i = 0; i < (19); i++)
    if (buf[i]) s |= 1 << i;
  memset(f, -1, sizeof f);
  f[0] = 0;
  if (calc(s))
    puts("Karlsson");
  else
    puts("Lillebror");
}
