#include <bits/stdc++.h>
using namespace std;
const int maxn = 1 << 19;
int nx[3][19] = {
    {1, 2, -1, 4, 5, 6, -1, 8, 9, 10, 11, -1, 13, 14, 15, -1, 17, 18, -1},
    {3, 4, 5, 7, 8, 9, 10, -1, 12, 13, 14, 15, -1, 16, 17, 18, -1, -1, -1},
    {4, 5, 6, 8, 9, 10, 11, 12, 13, 14, 15, -1, 16, 17, 18, -1, -1, -1, -1}};
int a[maxn], q;
char s[10];
bool game(int x) {
  if (a[x] != -1) return a[x];
  a[x] = 0;
  int now, mask;
  for (int i = 0; i < 19; i++) {
    for (int j = 0; j < 3; j++) {
      mask = 0;
      now = i;
      while (now != -1 && (x & (1 << now))) {
        mask |= (1 << now);
        if (!game(mask ^ x)) return a[x] = 1;
        now = nx[j][now];
      }
    }
  }
  return a[x];
}
int main() {
  memset(a, -1, sizeof a);
  a[0] = 0;
  for (int i = 0; i < 19; i++) {
    scanf("%s", s);
    s[0] == '.' ? 0 : q |= (1 << i);
  }
  game(q) ? cout << "Karlsson\n" : cout << "Lillebror\n";
  return 0;
}
