#include <bits/stdc++.h>
using namespace std;
int sol[10000000];
int appartiene[19][3] = {{0, 0, 2}, {0, 1, 3}, {0, 2, 4}, {1, 0, 1}, {1, 1, 2},
                         {1, 2, 3}, {1, 3, 4}, {2, 0, 0}, {2, 1, 1}, {2, 2, 2},
                         {2, 3, 3}, {2, 4, 4}, {3, 1, 0}, {3, 2, 1}, {3, 3, 2},
                         {3, 4, 3}, {4, 2, 0}, {4, 3, 1}, {4, 4, 2}};
int righe[5][5] = {{0, 1, 2, -1, -1},
                   {3, 4, 5, 6, -1},
                   {7, 8, 9, 10, 11},
                   {12, 13, 14, 15, -1},
                   {16, 17, 18, -1, -1}};
int sx[5][5] = {{0, 3, 7, -1, -1},
                {1, 4, 8, 12, -1},
                {2, 5, 9, 13, 16},
                {6, 10, 14, 17, -1},
                {11, 15, 18, -1, -1}};
int dx[5][5] = {{7, 12, 16, -1, -1},
                {3, 8, 13, 17, -1},
                {0, 4, 9, 14, 18},
                {1, 5, 10, 15, -1},
                {2, 6, 11, -1, -1}};
bool Presente(int bitmask, int num) {
  if (num == -1) return false;
  if ((bitmask & (1 << num)) == (1 << num))
    return true;
  else
    return false;
}
int Prova(int chi, int bitmask) {
  int winner = ((chi == 1) ? 2 : 1);
  if (sol[bitmask] != 0) {
    if (sol[bitmask] == 1)
      return winner;
    else
      return chi;
  }
  if (bitmask == 0) return winner;
  int appo = bitmask;
  for (int i = 0; i < 19; i++) {
    appo = bitmask;
    if (Presente(appo, i)) {
      if (Prova(winner, appo - (1 << i)) == chi) {
        sol[bitmask] = 2;
        return chi;
      }
      int riga = appartiene[i][0], s = appartiene[i][1], d = appartiene[i][2],
          mappa = appo;
      for (int j = 0; j < 5; j++) {
        if (righe[riga][j] == -1) break;
        mappa = appo;
        int x = j;
        while (Presente(mappa, righe[riga][x]) && x < 5) {
          mappa -= (1 << righe[riga][x]);
          if (Prova(winner, mappa) == chi) {
            sol[bitmask] = 2;
            return chi;
          }
          x++;
        }
      }
      for (int j = 0; j < 5; j++) {
        if (sx[d][j] == -1) break;
        mappa = appo;
        int x = j;
        while (Presente(mappa, sx[s][x]) && x < 5) {
          mappa -= (1 << sx[s][x]);
          if (Prova(winner, mappa) == chi) {
            sol[bitmask] = 2;
            return chi;
          }
          x++;
        }
      }
      for (int j = 0; j < 5; j++) {
        if (dx[d][j] == -1) break;
        mappa = appo;
        int x = j;
        while (Presente(mappa, dx[d][x]) && x < 5) {
          mappa -= (1 << dx[d][x]);
          if (Prova(winner, mappa) == chi) {
            sol[bitmask] = 2;
            return chi;
          }
          x++;
        }
      }
    }
  }
  sol[bitmask] = 1;
  return winner;
}
int main() {
  ios::sync_with_stdio(false);
  int bitmask = 0;
  for (int i = 0; i < 19; i++) {
    char tmp;
    cin >> tmp;
    if (tmp == 'O') bitmask |= (1 << i);
  }
  int win = Prova(1, bitmask);
  if (win == 1)
    cout << "Karlsson\n";
  else
    cout << "Lillebror\n";
  return 0;
}
