#include <bits/stdc++.h>
using namespace std;
inline bool isvowel(char ch) {
  ch = tolower(ch);
  return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u' ||
          ch == 'y');
}
inline bool isprime(int n) {
  if (n < 2 || (n % 2 == 0 && n != 2)) return false;
  for (int i = 3; i * i <= n; i += 2)
    if (n % i == 0) return false;
  return true;
}
const int N = 19;
int dp[1 << N];
vector<vector<int>> moves = {
    {0, 1, 2},         {16, 17, 18},      {7, 3, 0},        {18, 15, 11},
    {2, 6, 11},        {7, 12, 16},       {3, 4, 5, 6},     {12, 13, 14, 15},
    {12, 8, 4, 1},     {17, 14, 10, 6},   {1, 5, 10, 15},   {3, 8, 13, 17},
    {7, 8, 9, 10, 11}, {16, 13, 9, 5, 2}, {0, 4, 9, 14, 18}};
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  int i, j, k, l;
  dp[0] = 1;
  for (i = 1; i < (1 << N); i++) {
    dp[i] = 1;
    for (j = 0; j < 15; j++) {
      for (k = 0; k < moves[j].size(); k++) {
        int num = 0;
        for (l = k; l < moves[j].size(); l++) {
          if ((i & (1 << moves[j][l])) == 0) break;
          num += (1 << moves[j][l]);
          if (dp[i - num] == 1) dp[i] = 0;
        }
      }
    }
  }
  char s[19];
  int init = 0;
  for (i = 0; i < N; i++) {
    cin >> s[i];
    if (s[i] == 'O') {
      init += (1 << i);
    }
  }
  cout << (dp[init] == 0 ? "Karlsson" : "Lillebror");
  return 0;
}
