#include #define MAX_N 100001 #define INF_INT 2147483647 #define INF_LL 9223372036854775807 #define REP(i,n) for(int i=0;i<(int)(n);i++) using namespace std; typedef long long int ll; typedef pair P; void init(int n); int find(int n); void unite(int x,int y); bool same(int x, int y); ll bpow(ll,ll,ll); typedef vector vec; typedef vector mat; mat mul(mat &A,mat &B); mat pow(mat A,ll n); int dx[4] = {1,0,0,-1}; int dy[4] = {0,1,-1,0}; bool cmp_P(const P &a,const P &b){ return a.second < b.second; } int main() { int n=0; string S; string masu[8]; cin >> S; REP(i,8)cin >> masu[i]; REP(i,8)REP(j,8)if(masu[i][j] != '.')n++; if(n%2==0)cout << S << endl; else if(S == "yukiko"){ cout << "oda" << endl; }else cout << "yukiko" << endl; return 0; }