#include<bits/stdc++.h>

using namespace std;

const int N = 105;

typedef long long ll;

int has[5][20];
int cur = 1;
int offset;
int dfs(int play, int u, int stop) {
    if (u == 0 || u == 14) {
        return 0;
    }
    if (play == 0) {
        int ans = -1e9;
        if (has[cur][u]) {
            ans = max(ans, dfs(!play, u + offset, 0) + 1);
        }
        if (stop == 0) {
            ans = max(ans, dfs(!play, u, 1));
        } else {
            ans = max(ans, 0);
        }
        return ans;
    } else {
        int ans = 1e9;
        if (!has[cur][u]) {
            ans = min(ans, dfs(!play, u + offset, 0) - 1);
        }
        if (stop == 0) {
            ans = min(ans, dfs(!play, u, 1));
        } else {
            ans = min(ans, 0);
        }
        return ans;
    }
}
int curWin;

pair<int, int> dfsDraw(int play, int u, int stop) {
    if (u == 0 || u == 14) {
        if (curWin == 1) {
            return {0, 1};
        } else {
            return {0, -1};
        }
    }
    if (play == 0) {
        pair<int, int> ans = {-1e9, 0};
        if (has[cur][u]) {
            pair<int, int> res = dfsDraw(!play, u + offset, 0);
            res.first++;
            ans = max(ans, res);
        }
        if (stop == 0) {
            ans = max(ans, dfsDraw(!play, u, 1));
        } else {
            ans = max(ans, {0, 0});
        }
        return ans;
    } else {
        pair<int, int> ans = {1e9, 0};
        if (!has[cur][u]) {
            pair<int, int> res = dfsDraw(!play, u + offset, 0);
            res.first--;
            ans = min(ans, res);
        }

        if (stop == 0) {
            ans = min(ans, dfsDraw(!play, u, 1));
        } else {
            ans = min(ans, {0, 0});
        }


        return ans;
    }

}

int main() {
    ios::sync_with_stdio(false);
    char pre = 'S';
    int cnt = 1;
    for (int i = 0; i < 26; i++) {
        string s;
        cin >> s;
        char col = s[0];
        string num;
        for (int j = 1; j < s.size(); j++) {
            num += s[j];
        }
        int p = stoi(num);
        if (pre != col) {
            cnt++;
        }
        has[cnt][p] = 1;
        pre = col;
    }
    int turn = 0;
    while (cur <= 4) {
        if (cur == 1) {
            offset = -1;
            turn += dfs(!has[cur][7], 6, 0);
            offset = 1;
            turn += dfs(!has[cur][7], 8, 0);
            if (has[cur][7]) {
                turn++;
            } else {
                turn--;
            }
        } else {
            offset = -1;
            int res = dfs(!has[cur][7], 6, 0);
            offset = 1;
            res += dfs(!has[cur][7], 8, 0);;
            if (has[cur][7]) {
                res = max(0, res + 1);
            } else {
                res = min(0, res - 1);
            }
            turn += res;
        }
        cur++;
    }
    if (turn > 0) {
        cout << "Alice";
    } else if (turn < 0) {
        cout << "Bob";
        
    } else if (turn == 0) {
        
        while(1);
        curWin = has[1][7];
        cur = 1;
        bool sud = true;
        while (cur <= 4) {
            if (cur == 1) {
                offset = -1;
                auto res = dfsDraw(!has[cur][7], 6, 0);

               // cout <<" res1 " << res.second << endl;
                sud &= (res.second != 0);
                offset = 1;
                res = dfsDraw(!has[cur][7], 8, 0);
                sud &= (res.second != 0);

                //cout <<" res2 " << res.second << endl;
            } else {
                offset = -1;
                auto res = dfsDraw(!has[cur][7], 6, 0);
                offset = 1;
                auto res2 = dfsDraw(!has[cur][7], 8, 0);
                res.first += res2.first;
                //cout <<" r1 r2 " << res.second <<" " << res.second << endl;
                if( res.second != 0 && res2.second != 0){ // -1 -1 or 1 1
                    res.second = res.second + res2.second;
                }
                else{// 0 x
                    res.second = 0;
                }
                if (has[cur][7]) {
                    pair<int, int> tmp = {0, 0};
                    res = max(tmp, {res.first + 1, res.second});
                } else {
                    pair<int, int> tmp = {0, 0};
                    res = min(tmp, {res.first - 1, res.second});
                }
              //  cout <<" finali si " << res.first <<"<"<<res.second << endl;
                sud &= (res.second != 0);
            }
            cur++;
        }
        if(sud ){
            cout <<"Draw";
        }
        else{
            cout << (curWin ? "Bob":"Alice");
        }



    }


}