//include
#include<bits/stdc++.h>

//using
using namespace std;

//define static const typedef
#define FOR(i, s, n) for(int (i) = (s); (i) < (n); (i)++)
#define REP(i, n) FOR((i), 0, (n))
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SORT(a) sort(ALL(a))
#define RSORT(a) sort(RALL(a))
#define DUMP(x) cerr << #x << " = " << x << "\n";
#define DEBUG(x) cerr << #x << " = " << x << " (L:" << __LINE__ << ") " << __FILE__ << "\n";
#define F first
#define S second

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned long long ULL;

static const int INF = 1 << 25;

string str[2], s;
int cnt = 0;

int main(){
  cin >> str[0];
  if( str[0] == "oda"){
    str[1] = "yukiko";
  }
  else{
    str[1] = "oda";
  }
  for (int i = 0; i < 8; ++i){
    cin >> s;
    sort(s.begin(), s.end());
    cnt += 8 - (upper_bound(s.begin(), s.end(), '.') - lower_bound(s.begin(), s.end(), '.'));
  }
  printf("%s\n", str[cnt % 2].c_str());
  return 0;
}