#include <bits/stdc++.h>
using namespace std;
int d[][2] = {{1, 1}, {-1, 1}, {0, 2}};
int ln[30];
char mat[30][30];
int dp[1 << 20];
int u[30][30];
bool wins(int m) {
  if (m == 0) return 0;
  if (dp[m] != -1) return dp[m];
  bool win = 0;
  for (int i = 0; i < 5; ++i) {
    for (int j = 0; j < ln[i]; ++j) {
      if (mat[i][j] != 'O') continue;
      if ((m & (1 << u[i][j])) == 0) continue;
      for (int k = 0; k < 4; ++k) {
        int r = i, c = j, s = m;
        while (r < 5 && c < ln[r] && (m & (1 << u[r][c]))) {
          m -= 1 << u[r][c];
          win |= !wins(m);
          r += d[k][0], c += d[k][1];
        }
        m = s;
      }
    }
  }
  return dp[m] = win;
}
int x[] = {3, 4, 5, 4, 3};
int main() {
  for (int i = 0; i < 5; ++i) {
    int s = 5 - x[i];
    for (int j = 0; j < x[i]; ++j) {
      char c;
      while (c = getchar())
        if (c == '.' || c == 'O') break;
      mat[i][s] = c;
      s += 2;
    }
    ln[i] = s - 1;
  }
  int c = 0;
  for (int i = 0; i < 5; ++i)
    for (int j = 0; j < ln[i]; ++j)
      if (mat[i][j] == 'O' || mat[i][j] == '.') u[i][j] = c++;
  int mask = 0;
  for (int i = 0; i < 5; ++i)
    for (int j = 0; j < ln[i]; ++j)
      if (mat[i][j] == 'O') mask += 1 << u[i][j];
  memset(dp, -1, sizeof(dp));
  bool f = wins(mask);
  if (f)
    printf("Karlsson\n");
  else
    printf("Lillebror\n");
  return 0;
}
