#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
//#include <utility>
#include <set>
#include <iostream>
//#include <memory>
#include <string>
#include <vector>
#include <algorithm>
//#include <functional>
#include <sstream>
//#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
//#include <cctype>
#include <cstring>
//#include <ctime>
#include <iterator>
#include <bitset>
//#include <numeric>
//#include <list>
//#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


namespace{
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}


#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()


#define MOD 1000000007LL
#define EPS 1e-8
static const int INF=1<<24;

bool check(int x,int y){
	if(0<=x&&x<8&&0<=y&&y<8) return true;
	return false;
}
int dx[]={0,1,1,-1};
int dy[]={1,0,1,1};
vector<string> v(8);
void mainmain(){
	string s1="yukiko";
	string s2="oda";
	string s;
	cin>>s;
	if(s==s2){
		swap(s1,s2);
	}
	rep(i,8){
		cin>>v[i];
	}
	int a=0,b=0;
	rep(i,8){
		rep(j,8){
			// char t;
			// cin>>t;
			// cout<<i<<" "<<j<<endl;
			if(v[i][j]=='b'){
				rep(k,4){
					int x=i,y=j;
					int tmp=1;
					while(check(x+dx[k],y+dy[k])&&v[x+dx[k]][y+dy[k]]=='b'){
						x+=dx[k];
						y+=dy[k];
						tmp++;
					}
					a=max(a,tmp);
				}
			}
			else if(v[i][j]=='w'){
				rep(k,4){
					int x=i,y=j;
					int tmp=1;
					while(check(x+dx[k],y+dy[k])&&v[x+dx[k]][y+dy[k]]=='w'){
						x+=dx[k];
						y+=dy[k];
						tmp++;
					}
					b=max(b,tmp);
				}
			}
		}
	}
	if(a==1&&b==1){
		cout<<s1<<endl;
	}
	else if(a>b){
		cout<<s2<<endl;
	}
	else cout<<s1<<endl;
}



}
main() try{
    mainmain();
}
catch(...){
}