/*
Jackson Simoneau
SI@UCF 2026 - Intro to Competitive Programming
Final Contest

Solution to Mylla: https://open.kattis.com/problems/mylla2
*/

#include <bits/stdc++.h>
using namespace std;

int main() {
    //Read the board into a 2D vector
    vector<vector<char>> t(3, vector<char>(3));
    for(int i = 0; i < 3; i++) {
        string s; cin >> s;
        for(int j = 0; j < 3; j++) {
            t[i][j] = s[j];
        }
    }

    bool won = false;
    //Check across each row
    for(int r = 0; r < 3; r++) {
        bool good = true;
        for(int i = 0; i < 3; i++) {
            if(t[r][i] != 'O') good = false; 
        }
        if(good) won = true;
    }

    //Check down each column
    for(int c = 0; c < 3; c++) {
        bool good = true;
        for(int i = 0; i < 3; i++) {
            if(t[i][c] != 'O') good = false; 
        }
        if(good) won = true;
    }

    //Check the diagonals
    bool good = true;
    for(int i = 0; i < 3; i++) {
        if(t[i][i] != 'O') good = false;
    }
    if(good) won = true;

    good = true;
    for(int i = 0; i < 3; i++) {
        if(t[i][2-i] != 'O') good = false;
    }
    if(good) won = true;

    //See if any combination above produced a win for O
    if(won) cout << "Jebb\n";
    else cout << "Neibb\n";
}