• 문제 ID
• 시간 제한
• 메모리 제한
• 제출 횟수
• 정답 횟수 (비율)
• 출처
• 분류

#### 문제

Baduk is an ancient board game which requires deep strategy and tactics, where two players (Black and White) exchange their turns to place a stone in one of empty positions of the board. Black play with black stones, and White with white stones. You can also ‘pass’ to give up your opportunity to place a stone.

Baduk is known to be notoriously hard to solve with computers, but don’t worry! We will be dealing with a simplified and highly abstracted version of the game. See below for the rules of the game.

In this version of Baduk, each player has one stone group. Each empty position which is adjacent to a stone is called a liberty. We can classify each liberty as one of the following three types:

• Shared liberties (S$S$) - empty positions adjacent to both colors of stones.
• Inner liberties (I$I$) - empty positions completely enclosed within a stone group.
• Outer liberties (O$O$) - empty positions that is adjacent to a stone, which are not either Shared or Inner liberties.

Using these definitions, we can summarize the entire state of the game board into 5 non-negative integers: BO$BO$ (# of Outer liberties of Black), BI$BI$ (# of Inner liberties of Black), WO$WO$ (# of Outer liberties of White), WI$WI$ (# of Inner liberties of White), S$S$ (# of liberties shared by White and Black).

At each turn, a player can choose one of the numbers and decrease it by 1. There are a few rules:

1. No move can result in a negative number of liberties. (i.e. BO$BO$, BI$BI$, WO$WO$, WI$WI$, S$S$ should all be 0$0$ or greater after a move)
2. To decrease BI$BI$ from 1$1$ to 0$0$, both BO$BO$ and S$S$ must be 0$0$ already.
3. To decrease WI$WI$ from 1$1$ to 0$0$, both WO$WO$ and S$S$ must be 0$0$ already.
4. A player can pass his/her turn.

The winner of the game is determined as follows.

• A player loses when it does not have any liberties. For example, when BO = BI = S = 0$BO = BI = S = 0$, White wins.
• When all five numbers become 0$0$ by decreasing S$S$ the last time, the last person who made the move wins.

Write a program that, given the 5 numbers, determine who will win assuming Black plays first, and both players play optimally. Note that there are cases where no player can win the game.

#### 입력

The first line of the input will contain the number of test cases N$N$. (1 \le N \le 10\,000$1 \le N \le 10\,000$) N$N$ lines follow, with 5 non-negative integers, each representing BO$BO$, BI$BI$, S$S$, WO$WO$ and WI$WI$, in this order. (0 \le BO$0 \le BO$, WO$WO$, S \le 10^9$S \le 10^9$, 0 \le BI$0 \le BI$, WI \le 2$WI \le 2$, BO + BI + S \ge 1$BO + BI + S \ge 1$, WO + WI + S \ge 1$WO + WI + S \ge 1$)

#### 출력

For each test case, print a single line containing the winner of the game ("White" or "Black"). In case no one can win the game, print "Neither".

#### 예제 입력

3
3 0 0 3 0
3 0 0 4 0
0 0 2 0 0

#### 예제 출력

Black
White
Neither