#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>

#define N 1000
#define MOD 1000000007
#define pe(str) return cout<<(str)<<endl,0
#define px(str) {cout<<(str)<<endl;exit(0);}
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fe(i,n,f) for_each(i,n,f)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;

int main(void){
	string s[8];
	string k,t;
	int a[2]={0};
	cin>>k;
	t=(k=="oda")?"yukiko":"oda";

	re(i,8)cin>>s[i];
	re(i,8){
		re(j,8){
			if(s[i][j]=='b')a[0]++;
			else if(s[i][j]=='w')a[1]++;
		}
	}
	if(a[0]%2==0&&a[1]%2==0)pe(k);
	else if(a[0]%2==1&&a[1]%2==0)pe(t);
	else if(a[0]%2==0&&a[1]%2==1)pe(k);
	else pe(t);
	return 0;
}