#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const long long INF64 = 1e18;
const double PI = acos(-1.0);
const double EPS = 1e-8;
const int MOD = 1000000007;
const int N = 110;
int k;
int a[N][N];
int x[N], y[N];
int dp[1 << 19];
int dx[] = {-1, 1, 1, -1, 0, 0};
int dy[] = {-1, 1, -1, 1, -2, 2};
bool calc(int mask, int cnt);
bool inside(int x, int y) { return x >= 0 && x < 5 && y >= 0 && y < 9; }
bool get(int cx, int cy, int i, int mask, int cnt, int dir1, int dir2) {
  bool win = false;
  for (int c1 = 0; c1 < int(3); c1++)
    for (int c2 = 0; c2 < int(3); c2++) {
      int ncnt = cnt - 1;
      int nmask = mask & ~(1 << i);
      bool ok1 = true;
      int lx = cx, ly = cy;
      for (int _ = 0; _ < int(c1); _++) {
        lx += dx[dir1];
        ly += dy[dir1];
        if (inside(lx, ly) && a[lx][ly] != -1 && (mask & (1 << a[lx][ly]))) {
          ncnt--;
          nmask &= ~(1 << a[lx][ly]);
        } else {
          ok1 = false;
          break;
        }
      }
      bool ok2 = true;
      int rx = cx, ry = cy;
      for (int _ = 0; _ < int(c2); _++) {
        rx += dx[dir2];
        ry += dy[dir2];
        if (inside(rx, ry) && a[rx][ry] != -1 && (mask & (1 << a[rx][ry]))) {
          ncnt--;
          nmask &= ~(1 << a[rx][ry]);
        } else {
          ok2 = false;
          break;
        }
      }
      if (ok1 && ok2) {
        win |= !calc(nmask, ncnt);
      }
    }
  return win;
}
bool calc(int mask, int cnt) {
  if (dp[mask] != -1) return dp[mask];
  if (cnt == 0) return dp[mask] = 0;
  bool win = false;
  for (int i = 0; i < int(k); i++) {
    if (mask & (1 << i)) {
      win |= get(x[i], y[i], i, mask, cnt, 0, 1);
      win |= get(x[i], y[i], i, mask, cnt, 2, 3);
      win |= get(x[i], y[i], i, mask, cnt, 4, 5);
    }
  }
  return dp[mask] = win;
}
int main() {
  for (int i = 0; i < int(N); i++)
    for (int j = 0; j < int(N); j++) a[i][j] = -1;
  for (int i = 0; i < int(5); i++) {
    string s;
    getline(cin, s);
    for (int j = 0; j < int((int)s.size()); j++) {
      if (s[j] == 'O') {
        x[k] = i;
        y[k] = j;
        a[i][j] = k;
        k++;
      }
    }
  }
  memset(dp, -1, sizeof(dp));
  if (calc((1 << k) - 1, k)) {
    cout << "Karlsson" << endl;
  } else {
    cout << "Lillebror" << endl;
  }
  return 0;
}
