#include <bits/stdc++.h>
using namespace std;
struct hash_pair {
  template <class T1, class T2>
  size_t operator()(const pair<T1, T2>& p) const {
    auto hash1 = hash<T1>{}(p.first);
    auto hash2 = hash<T2>{}(p.second);
    return hash1 ^ hash2;
  }
};
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  a %= b;
  return gcd(b, a);
}
long long binpow(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
void solve() {
  unordered_map<char, long long> mp;
  long long w = 0, b = 0;
  mp['q'] = 9;
  mp['r'] = 5;
  mp['b'] = 3;
  mp['n'] = 3;
  mp['p'] = 1;
  mp['k'] = 0;
  for (long long i = 0; i < 8; ++i) {
    for (long long j = 0; j < 8; ++j) {
      char x;
      cin >> x;
      if (isupper(x) && x != '.') {
        w += mp[tolower(x)];
      } else {
        b += mp[tolower(x)];
      }
    }
  }
  if (b > w)
    cout << "Black";
  else if (w > b)
    cout << "White";
  else
    cout << "Draw";
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  solve();
}
