Horsemeet

8x8 체스판에서 두 나이트가 무작위로 움직이며 상대 칸에 도착하면 이기는 게임에서, 주어진 시작 위치일 때 승률이 더 높은 나이트를 판정한다.

어려움8확률그래프동적 계획법시뮬레이션아직 제출이 없습니다시간 제한2초메모리 제한512 MB

문제

Traditional games such as chess or checkers, with slight modifications are also played in Binary Casino. However, not many people play them, as these games are often referred as boring. The visitors are more attracted to more dynamic games which cause adrenaline rushes. To attract players to traditional games, your boss wants to introduce a chess-based game called Horsemeet. The rules of the game are:

The game is played by two players on a 8 × 8 chessboard. One player plays a white knight and the other player plays a black knight. The players alternate in moves, the white knight moves first. In each move a knight is moved from its current position to a random valid position. Valid position within the chessboard is a position, which is two tiles away in one coordinate and one tile away in other coordinate from the original position. All moves to a valid position are equally probable. The first knight to move to a tile already occupied by the other knight wins.

In order to check whether this game could be at least partially interesting to visitors you have to determine the probability of victory for knights at given start positions. If the probabilities of victory for both knights differ by less than 10−6 the outcome of such configuration is a draw.

입력

The first line of input contains two integers A and B (1 ≤ A, B ≤ 8), the start position of the white knight. The second line of each input consists of two integers C and D (1 ≤ C, D ≤ 8), the start position of the black knight. You can assume both positions are distinct.

출력

Output the knight with a higher probability of victory: “white” or “black”. In case of equal probabilities output “draw”.