#include <bits/stdc++.h>
using namespace std;
char st[2];
int state, op[1 << 19], n;
int f[1 << 19];
int check(int st) {
  static int a[10][10], x, y, cnt;
  x = 0, y = 0, cnt = __builtin_popcount(st);
  if (cnt == 1) return 1;
  for (int i = 1; i <= 5; i++)
    for (int j = max(1, i - 2); j <= min(5, i + 2); j++) {
      a[i][j] = st & 1, st >>= 1;
      if (a[i][j] && !x) x = i, y = j;
    }
  if (a[x][y + 1]) {
    for (int i = y; a[x][i]; i++) a[x][i] = 0, cnt--;
  } else if (a[x + 1][y]) {
    for (int i = x; a[i][y]; i++) a[i][y] = 0, cnt--;
  } else {
    for (int i = 0; a[x + i][y + i]; i++) a[x + i][y + i] = 0, cnt--;
  }
  return !cnt;
}
int F(int st) {
  if (~f[st]) return f[st];
  f[st] = 0;
  for (int i = 0; i < n; i++)
    if ((st & op[i]) == op[i])
      if (f[st] = !F(st ^ op[i])) break;
  return f[st];
}
int main() {
  for (int i = 0; i < 19; i++)
    scanf("%s", st), state = (state << 1) | (st[0] == '.' ? 0 : 1);
  for (int i = 1; i < (1 << 19); i++)
    if (check(i)) op[n++] = i;
  memset(f, 0xff, sizeof(f));
  f[0] = 0;
  puts(F(state) ? "Karlsson" : "Lillebror");
  return 0;
}
