#include <bits/stdc++.h>
using namespace std;
int dp[1100000];
int key[30];
int num[20] = {3, 4, 5, 4, 3, 3, 4, 5, 4, 3, 3, 4, 5, 4, 3};
int graph[20][20] = {{1, 2, 3},          {4, 5, 6, 7},       {8, 9, 10, 11, 12},
                     {13, 14, 15, 16},   {17, 18, 19},       {1, 4, 8},
                     {2, 5, 9, 13},      {3, 6, 10, 14, 17}, {7, 11, 15, 18},
                     {12, 16, 19},       {3, 7, 12},         {2, 6, 11, 16},
                     {1, 5, 10, 15, 19}, {4, 9, 14, 18},     {8, 13, 17}};
void dfs(int now) {
  int mark;
  bool flag = false;
  for (int i = 0; i < 15; i++) {
    int limit = num[i];
    for (int j = 0; j < limit; j++) {
      if (now & key[graph[i][j]]) {
        int k;
        for (k = j; k < limit; k++)
          if ((now & key[graph[i][k]]) == 0) break;
        mark = now;
        for (int t = j; t < k; t++) {
          mark -= key[graph[i][t]];
          if (dp[mark] == -1) dfs(mark);
          if (dp[mark] == 0) flag = true;
        }
      }
    }
  }
  if (flag)
    dp[now] = true;
  else
    dp[now] = false;
}
int main() {
  string s, now;
  s = "";
  for (int i = 0; i < 19; i++) {
    cin >> now;
    s += now;
  }
  int mark = 0;
  int id = 1;
  for (int i = 18; i >= 0; i--) {
    if (s[i] == 'O') mark += id;
    id *= 2;
  }
  id = 1;
  for (int i = 1; i <= 19; i++) {
    key[i] = id;
    id *= 2;
  }
  memset(dp, -1, sizeof(dp));
  dp[0] = 0;
  dfs(mark);
  if (dp[mark])
    cout << "Karlsson" << endl;
  else
    cout << "Lillebror" << endl;
  return 0;
}
