#include <bits/stdc++.h>
using namespace std;
vector<vector<char> > g(5 + 1, vector<char>(5 + 1));
vector<int> dp(1 << 21, -1);
int s[] = {0, 1, 1, 1, 2, 3};
int e[] = {0, 3, 4, 5, 5, 5};
int dir[][2] = {{1, 0}, {0, 1}, {1, 1}};
bool bound(int x, int y) { return x >= 1 && x <= 5 && y >= s[x] && y <= e[x]; }
bool dfs() {
  int cur = 0;
  for (int i = 1; i <= 5; i++) {
    for (int j = s[i]; j <= e[i]; j++) {
      cur <<= 1;
      if (g[i][j] == 'O') {
        cur |= 1;
      }
    }
  }
  if (dp[cur] != -1) {
    return dp[cur] == 1;
  }
  int res = 0;
  for (int i = 1; i <= 5; i++) {
    for (int j = s[i]; j <= e[i]; j++) {
      for (int k = 0; k < 3; k++) {
        if (g[i][j] == 'O') {
          int t = 0;
          for (; bound(i + t * dir[k][0], j + t * dir[k][1]) &&
                 g[i + t * dir[k][0]][j + t * dir[k][1]] == 'O';
               t++) {
            g[i + t * dir[k][0]][j + t * dir[k][1]] = '.';
            int tmp = dfs();
            if (tmp == false) {
              res = 1;
              t++;
              break;
            }
          }
          for (t--; t >= 0; t--) {
            g[i + t * dir[k][0]][j + t * dir[k][1]] = 'O';
          }
          if (res == 1) {
            break;
          }
        }
      }
      if (res == 1) {
        break;
      }
    }
    if (res == 1) {
      break;
    }
  }
  return (dp[cur] = res) == 1;
}
int main(void) {
  char str[10];
  for (int i = 1; i <= 5; i++) {
    for (int j = s[i]; j <= e[i]; j++) {
      scanf("%s", str);
      g[i][j] = str[0];
    }
  }
  if (dfs()) {
    puts("Karlsson");
  } else {
    puts("Lillebror");
  }
  return 0;
}
