#include <bits/stdc++.h>
using namespace std;
int matr[5][5] = {
    {-1, 0, 1, 2, -1},    {3, 4, 5, 6, -1},     {7, 8, 9, 10, 11},
    {12, 13, 14, 15, -1}, {-1, 16, 17, 18, -1},
};
int dirs[3][5][2] = {
    {{0, 0}, {0, 1}, {0, 1}, {0, 1}, {0, 1}},
    {{0, 0}, {1, -1}, {1, 0}, {1, -1}, {1, 0}},
    {{0, 0}, {1, 0}, {1, 1}, {1, 0}, {1, 1}},
};
int mem[1 << 19];
int f(int mask) {
  if (mem[mask] != -1) return mem[mask];
  bool win = false;
  for (int i = 0; i < 5; i++)
    for (int j = 0; j < 5; j++)
      for (int d = 0; d < 3; d++) {
        int x = i;
        int y = j;
        int c = 0;
        if (d != 0 && i % 2 == 1) c = 1;
        int m = 0;
        while (c < 5 && x >= 0 && x < 5 && y >= 0 && y < 5 &&
               matr[x][y] != -1 && ((1 << matr[x][y]) & mask) != 0) {
          m += (1 << matr[x][y]);
          if (f(mask - m) == 0) win = true;
          c++;
          x = x + dirs[d][c][0];
          y = y + dirs[d][c][1];
        }
      }
  int res = win ? 1 : 0;
  mem[mask] = res;
  return res;
}
int main() {
  int mask = 0;
  int k = 0;
  for (int i = 0; i < 5; i++) {
    for (int j = 0; j < 5 - abs(i - 2); j++) {
      char s[10];
      scanf("%s", s);
      if (s[0] != '.') mask += (1 << k);
      k++;
    }
  }
  for (int i = 0; i < (1 << 19); i++) mem[i] = -1;
  int res = f(mask);
  if (res == 0)
    printf("Lillebror\n");
  else
    printf("Karlsson\n");
  return 0;
}
