import java.util.Scanner;

public class Horsemeet {
	
	static int winWhite = 0;
	static int winBlack = 0;
	
	public static final int[] MOVE_I = { -2, -2, +2, +2, +1, -1, +1, -1};
	public static final int[] MOVE_J = { +1, -1, +1, -1, -2, -2, +2, +2};
	
	public static double winW = 0;
	public static double winB = 0;
	
	public static final long MAX_STATES = 1000000;
	public static long states = 0;

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int xw = sc.nextInt();
		int yw = sc.nextInt();
		int xb = sc.nextInt();
		int yb = sc.nextInt();
		
		char[][] curr = new char[8][8];
		char[][] prev = new char[8][8];
		
		clear(curr);
		clear(prev);
		
		
		prev[yw - 1][xw - 1] = 'W';
		prev[yb - 1][xb - 1] = 'B';
		char player = 'W';
		
		while (states < MAX_STATES) {
//			sc.nextLine();
//			printBoard(prev);
			newState(prev, curr, player);
			copy(curr, prev);
			clear(curr);
			player = player == 'W' ? 'B' : 'W';
		}

		
		double diff = winW - winB;
		
		if (Math.abs(diff) < 10e-6) {
			System.out.println("draw");
		} else if (diff > 0) {
			System.out.println("white");
		} else {
			System.out.println("black");

		}
		
	}
	
	public static void clear(char[][] b) {
		for (int i = 0; i < 8; i++) {
			for (int j = 0; j < 8; j++) {
				b[i][j] = ' ';
			}
		}
	}
	
	public static void newState(char[][] curr, char[][] next, char player) {
		for (int i = 0; i < 8; i++) {
			for (int j = 0; j < 8; j++) {
				if (curr[i][j] != ' ') {
					if (curr[i][j] != player) {
						next[i][j] = curr[i][j];
						continue;
					}
					for (int m = 0; m < MOVE_I.length; m++) {
						int newI = i + MOVE_I[m];
						int newJ = j + MOVE_J[m];
						if (valid(newI, newJ)) {
							states++;
							if (curr[newI][newJ] != ' ') {
								if (player == 'W' && curr[newI][newJ] == 'B') {
									winW += 1 / (double)states;
								} else if (player == 'B' && curr[newI][newJ] == 'W') {
									winB += 1 / (double)states;
								}
							} else {
								next[newI][newJ] = player;
							}
						}
					}
					if (states > MAX_STATES) {
						return;
					}
				}
			}
		}
	}
	
	public static boolean valid(int i, int j) {
		return i >= 0 && j >= 0 && i < 8 && j < 8;
	}
	
	public static void copy(char[][] curr, char[][] prev) {
		for (int i = 0; i < 8; i++) {
			for (int j = 0; j < 8; j++) {
				prev[i][j] = curr[i][j];
				
			}
		}
	}
	
	public static void printBoard(char[][] b) {
		for (int i = 0; i < 8; i++) {
			for (int j = 0; j < 8; j++) {
				System.out.print(b[i][j]);
				
			}
			System.out.println();
		}
	}
}