#include <bits/stdc++.h>
using namespace std;
map<pair<int, pair<int, int> >, int> mp;
int first[4][500], arr[4];
string cnt[4];
int las[4];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < 3; ++i) cin >> cnt[i];
  int m = cnt[0].size();
  for (int i = 0; i < 3; ++i) {
    for (int j = 0; j < m; ++j) {
      int x;
      if (cnt[i][j] > 'Z')
        x = cnt[i][j];
      else
        x = cnt[i][j];
      first[i][x]++;
      arr[i] = max(arr[i], first[i][x]);
    }
  }
  for (int i = 0; i < 3; ++i) {
    int rem = m - arr[i];
    if (rem >= n)
      las[i] = arr[i] + n;
    else {
      if (rem == 0 && n == 1)
        las[i] = m - 1;
      else
        las[i] = m;
    }
    arr[i] = las[i];
  }
  if (arr[0] > arr[1] && arr[0] > arr[2])
    cout << "Kuro" << endl;
  else if (arr[1] > arr[0] && arr[1] > arr[2])
    cout << "Shiro" << endl;
  else if (arr[2] > arr[0] && arr[2] > arr[1])
    cout << "Katie" << endl;
  else
    cout << "Draw" << endl;
  return 0;
}
