#include <bits/stdc++.h>
using namespace std;
typedef signed char sint;
sint s[9], dp[8][8][8][8][8][8][8][8], f[4][14];
sint solve(vector <int> l, vector <int> r, int t) {
	sint &p = dp[l[0]][l[1]][l[2]][l[3]][r[0]][r[1]][r[2]][r[3]];
	if (~ p) return p;
	if (l == vector <int> (4, 6) && r == vector <int> (4, 6)) return p = 1;
	p = 0;
	for (int i=0; i<4; i++) {
		if (l[i] < 6 && f[i][6-l[i]] == t)
			l[i] ++, p = max(p, sint (2 - solve(l, r, ! t))), l[i] --;
		if (r[i] < 6 && f[i][8+r[i]] == t)
			r[i] ++, p = max(p, sint (2 - solve(l, r, ! t))), r[i] --;
		if (l[i] == 7 && f[i][7] == t)
			l[i] = r[i] = 0, p = max(p, sint (2 - solve(l, r, ! t))), l[i] = r[i] = 7;
	} return p;
}
int main() {
	for (int i=1; i<=26; i++)
		scanf ("%s", s), f[s[0]=='S'?0:s[0]=='H'?1:s[0]=='C'?2:3][s[2]?(s[1]-'0')*10+s[2]-'0':s[1]-'0'] = 1;
	memset (dp, - 1, sizeof dp);
	sint p = solve({0, 7, 7, 7}, {0, 7, 7, 7}, ! f[0][7]);
	puts (p & 1 ? "Draw" : p >> 1 ^ f[0][7] ? "Alice" : "Bob");
}