#include <bits/stdc++.h>

using namespace std;

long double dp[2][8][8][8][8];


int dX[] = {2,2, -2,-2,1,-1, 1,-1};
int dY[] = {1,-1,-1,-1,2, 2,-2,-2};

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	int x,y,X,Y;
	queue<pair<pair<int,int>,pair<int,int> > >Q;
	
	cin>>x>>y>>X>>Y;
	
	--x,--y,--X,--Y;
	dp[0][y][x][Y][X] = 1;
	Q.push({{x,y},{X,Y}});
	
	long double resW = 0, resB = 0;
	
	for(int i = 0; i< 100; ++i)
	{
		decltype(Q) newQ;
		
		//cout<<i<<' '<<Q.size()<<'\n';
		int c = i%2;
		int n = c^1;
		//cout<<c<<' '<<n<<'\n';
		while(Q.size())
		{
			x = Q.front().first.first;
			y = Q.front().first.second;
			X = Q.front().second.first;
			Y = Q.front().second.second;
			Q.pop();
			
			//cout<<x<<' '<<y<<' '<<X<<' '<<Y<<' ';
			//cout<<dp[c][y][x][Y][X]<<'\n';
			
			if(x == X && y == Y)
			{
				//cout<<"ROWNE\n";
				//cout<<dp[c][y][x][Y][X]<<'\n';
				if(c == 0)
				{
					resB += dp[c][y][x][Y][X];
					
				}
				else
					resW += dp[c][y][x][Y][X];
					
				dp[c][y][x][Y][X] = 0;
				continue;
			}
			
			
			if(c == 0)
			{
				int ile = 0;
				for(int j = 0; j < 8; ++j)
				{
					int nX = x + dX[j];
					int nY = y + dY[j];
					if(nY >= 0 && nY < 8 && nX >=0 && nX < 8)
					{
						++ile;
					}	
				
				}
				for(int j = 0; j < 8; ++j)
				{
					int nX = x + dX[j];
					int nY = y + dY[j];
					if(nY >= 0 && nY < 8 && nX >=0 && nX < 8)
					{
					
						bool dodac = dp[n][nY][nX][Y][X] == 0;
						//cout<<"dp "<<dp[n][nY][nX][Y][X]<<'\t';
						dp[n][nY][nX][Y][X] += dp[c][y][x][Y][X]/ile;
						//cout<<dp[n][nY][nX][Y][X]<<'\n';
						if(dodac)
							newQ.push({{nX,nY},{X,Y}});
					}	
				
				}
			}
			
			else
			{
				int ile = 0;
				for(int j = 0; j < 8; ++j)
				{
					int nX = X + dX[j];
					int nY = Y + dY[j];
					if(nY >= 0 && nY < 8 && nX >=0 && nX < 8)
					{
						++ile;
					}	
				
				}
				for(int j = 0; j < 8; ++j)
				{
					int nX = X + dX[j];
					int nY = Y + dY[j];
					if(nY >= 0 && nY < 8 && nX >=0 && nX < 8)
					{
						bool dodac = dp[n][y][x][nY][nX]  == 0;
						dp[n][y][x][nY][nX] += dp[c][y][x][Y][X]/ile;
						if(dodac)
						newQ.push({{x,y},{nX,nY}});
					}	
				
				}
			
			}
			
			dp[c][y][x][Y][X] = 0;
			
			
		
		}	
		Q = newQ;
	}
	
	//cout<<resW<<' '<<resB;
	if(abs(resW - resB) < 1e-6)
	{
		cout<<"draw";
		return 0;
	}
	if(resW < resB)
	{
		cout<<"black";
	}
	else
	{
		cout<<"white";
	}

	

	return 0;
}