Karlsson has visited Lillebror again. They found a box of chocolates and a big whipped cream cake at Lillebror's place. Karlsson immediately suggested to divide the sweets fairly between Lillebror and himself. Specifically, to play together a game he has just invented with the chocolates. The winner will get the cake as a reward.

The box of chocolates has the form of a hexagon. It contains 19 cells for the chocolates, some of which contain a chocolate. The players move in turns. During one move it is allowed to eat one or several chocolates that lay in the neighboring cells on one line, parallel to one of the box's sides. The picture below shows the examples of allowed moves and of an unacceptable one. The player who cannot make a move loses.

<image>

Karlsson makes the first move as he is Lillebror's guest and not vice versa. The players play optimally. Determine who will get the cake.

Input

The input data contains 5 lines, containing 19 words consisting of one symbol. The word "O" means that the cell contains a chocolate and a "." stands for an empty cell. It is guaranteed that the box contains at least one chocolate. See the examples for better understanding.

Output

If Karlsson gets the cake, print "Karlsson" (without the quotes), otherwise print "Lillebror" (yet again without the quotes).

Examples

Input

  . . .
 . . O .
. . O O .
 . . . .
  . . .


Output

Lillebror

Input

  . . .
 . . . O
. . . O .
 O . O .
  . O .


Output

Karlsson

import java.util.*;

public class E {

    int p2[] = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024,
        2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144};

    boolean bitSetted(int code, int bitNo) {
        return (code & (1 << bitNo)) != 0;
    }

    int clearBit(int code, int bitNo) {
        return code - p2[bitNo];
    }

    public static void main(String[] args) {
        new E().main();
    }
    int[][] gameLines = {
        // horizontal
        {0, 1, 2},
        {3, 4, 5, 6},
        {7, 8, 9, 10, 11},
        {12, 13, 14, 15},
        {16, 17, 18},
        // /-diag
        {7, 3, 0},
        {12, 8, 4, 1},
        {16, 13, 9, 5, 2},
        {17, 14, 10, 6},
        {18, 15, 11},
        // \-diag
        {2, 6, 11},
        {1, 5, 10, 15},
        {0, 4, 9, 14, 18},
        {3, 8, 13, 17},
        {7, 12, 16}
    };
    int sg_values[] = new int[530000];

    boolean canDoMove(int position, int gameLineNo, int left, int right) {
        for (int i = left; i <= right; i++) {
            if (!bitSetted(position,gameLines[gameLineNo][i])) {
                return false;
            }
        }
        return true;
    }

    int doMove(int position, int gameLineNo, int left, int right) {
        int res = position;
        for (int i = left; i <= right; i++) {
            res = clearBit(res, gameLines[gameLineNo][i]);
        }
        return res;
    }

    ArrayList<Integer> inOneMove(Integer position) {
        ArrayList<Integer> res = new ArrayList<Integer>();

        for (int i = 0; i < gameLines.length; i++) {
            for (int left = 0; left < gameLines[i].length; left++) {
                for (int right = left; right < gameLines[i].length; right++) {
                    if (canDoMove(position, i, left, right)) {
                        res.add(doMove(position, i, left, right));
                    }
                }
            }
        }
        return res;
    }

    // false, если позиция проигрышная
    // true,  если выигрышная
    int SG(Integer position) {
        if (sg_values[position] != 0) {
            return sg_values[position];
        }
        //System.out.println("Calculating SG for " + position);
        int res = -1;
        for (int x : inOneMove(position)) {
            if (SG(x) == -1) {
                res = 1;
                break;
            }
        }
        sg_values[position] = res;
        return res;
    }

    void main() {
        String spos = "";
        Scanner in = new Scanner(System.in);
        for (int i = 0; i < 5; i++) {
            String line = in.nextLine();
            for (char c : line.toCharArray()) {
                if (c == '.' || c == 'O') {
                    spos += c;
                }
            }
        }
        int now = 0;
        for (int i = 0; i < spos.length(); i++) {
            if (spos.charAt(i) == 'O') {
                now += p2[i];
            }
        }
        sg_values[0] = -1;
        if (SG(now) == -1) {
            System.out.println("Lillebror");
        } else {
            System.out.println("Karlsson");
        }
    }
}
