#pragma GCC optimize("Ofast")
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>

const long long INF_L = 1e17+7;
const long long INF_I = 1e9+7;
const long long MOD = 1e9+7;
const double EPS = 1e-8;
const double PI=acos(-1);

using namespace std;

int main(){	
	string s;
	cin >> s;
	string t;
	
	if(s=="oda"){
		t="yukiko";
	}else{
		t="oda";
	}
	
	int cnt=0;
	for(int i=0;i<8;i++){
		for(int j=0;j<8;j++){
			char c;
			cin >> c;
			if(c=='.')continue;
			cnt++;
		}
	}
		
	if(cnt%2==0){
		cout << s << endl;
	}else{
		cout << t << endl;
	}	
	
	return 0;
}