#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1 << 20;
long long DOS[30];
vector<int> G[MAXN];
int W[MAXN];
bool win(int bm) {
  if (bm == DOS[19] - 1) return false;
  int &ret = W[bm];
  if (ret != -1) return ret;
  for (int i = (0); i < (int)(19); i++) {
    if (bm & (1 << i)) continue;
    if (!win(bm + (1 << i))) return ret = true;
    for (int dir = (0); dir < (int)(3); dir++) {
      int BM = bm + (1 << i);
      int p = i;
      while (G[p][dir] != -1 && !(bm & (1 << G[p][dir]))) {
        BM += (1 << G[p][dir]);
        if (!win(BM)) return ret = true;
        p = G[p][dir];
      }
    }
  }
  return ret = false;
}
int n;
int main() {
  DOS[0] = 1;
  for (int i = (1); i < (int)(30); i++) DOS[i] = DOS[i - 1] * 2;
  G[0] = {1, 3, 4};
  G[1] = {2, 4, 5};
  G[2] = {-1, 5, 6};
  G[3] = {4, 7, 8};
  G[4] = {5, 8, 9};
  G[5] = {6, 9, 10};
  G[6] = {-1, 10, 11};
  G[7] = {8, -1, 12};
  G[8] = {9, 12, 13};
  G[9] = {10, 13, 14};
  G[10] = {11, 14, 15};
  G[11] = {-1, 15, -1};
  G[12] = {13, -1, 16};
  G[13] = {14, 16, 17};
  G[14] = {15, 17, 18};
  G[15] = {-1, 18, -1};
  G[16] = {17, -1, -1};
  G[17] = {18, -1, -1};
  G[18] = {-1, -1, -1};
  for (int i = (0); i < (int)(MAXN); i++) W[i] = -1;
  int B = 0;
  for (int i = (0); i < (int)(19); i++) {
    string X;
    cin >> X;
    if (X == ".") B += (1 << i);
  }
  cout << (win(B) ? "Karlsson" : "Lillebror") << endl;
  return 0;
}
