Problem: On a chessboard with a width of n and a height of n, rows are numbered from bottom to top from 1 to n, columns are numbered from left to right from 1 to n. Therefore, for each cell of the chessboard, you can assign the coordinates (r,c), where r is the number of the row, and c is the number of the column.

The white king has been sitting in a cell with (1,1) coordinates for a thousand years, while the black king has been sitting in a cell with (n,n) coordinates. They would have sat like that further, but suddenly a beautiful coin fell on the cell with coordinates (x,y)...

Each of the monarchs wanted to get it, so they decided to arrange a race according to slightly changed chess rules:

As in chess, the white king makes the first move, the black king makes the second one, the white king makes the third one, and so on. However, in this problem, kings can stand in adjacent cells or even in the same cell at the same time.

The player who reaches the coin first will win, that is to say, the player who reaches the cell with the coordinates (x,y) first will win.

Let's recall that the king is such a chess piece that can move one cell in all directions, that is, if the king is in the (a,b) cell, then in one move he can move from (a,b) to the cells (a + 1,b), (a - 1,b), (a,b + 1), (a,b - 1), (a + 1,b - 1), (a + 1,b + 1), (a - 1,b - 1), or (a - 1,b + 1). Going outside of the field is prohibited.

Determine the color of the king, who will reach the cell with the coordinates (x,y) first, if the white king moves first.

Input

The first line contains a single integer n (2 ≤ n ≤ 10^{18}) — the length of the side of the chess field.

The second line contains two integers x and y (1 ≤ x,y ≤ n) — coordinates of the cell, where the coin fell.

Output

In a single line print the answer "White" (without quotes), if the white king will win, or "Black" (without quotes), if the black king will win.

You can print each letter in any case (upper or lower).

Examples

Input

4
2 3


Output

White

Input

5
3 5


Output

Black

Input

2
2 2


Output

Black

Note

An example of the race from the first sample where both the white king and the black king move optimally:

  1. The white king moves from the cell (1,1) into the cell (2,2).
  2. The black king moves form the cell (4,4) into the cell (3,3).
  3. The white king moves from the cell (2,2) into the cell (2,3). This is cell containing the coin, so the white king wins.

<image>

An example of the race from the second sample where both the white king and the black king move optimally:

  1. The white king moves from the cell (1,1) into the cell (2,2).
  2. The black king moves form the cell (5,5) into the cell (4,4).
  3. The white king moves from the cell (2,2) into the cell (3,3).
  4. The black king moves from the cell (4,4) into the cell (3,5). This is the cell, where the coin fell, so the black king wins.

<image>

In the third example, the coin fell in the starting cell of the black king, so the black king immediately wins.

<image>

Solution (in PYTHON3):

Solution:
import sys

# Parse inputs
length_of_board = int(input())
price_coordinates = tuple(map(int,input().split(" ")))

# Define starting points
# Assuming that our chessboard is always a square
starting_point_white = (1,1)
starting_point_black = (int(length_of_board), int(length_of_board))

"""
Let price coordinates be a and b; If a > b then

amount of steps to equals abs(a,b) + abs(1,b)

We keep adding (1,1) to our current coordinates in the board until one of our
coordinate values equals a or b. Then we calculate the difference between a and
b to get the rest of the steps.

if a and b are equal then amount of steps is the difference between any of the
price coordinate values and our starting point, so 5,5 as a and b, when starting
point is 1,1, we can derive that it will take four steps.

""" 
# Calculate steps using the first values in dicts 
# input 8 <- board length  8 1 <- coordinates
steps_for_white = abs(price_coordinates[0] - price_coordinates[1])
# sfw should be 7
steps_for_black = abs(price_coordinates[0] - price_coordinates[1])
# sfb should also be 7

# if a > b then b is the first value we'll reach
if price_coordinates[0] > price_coordinates[1]:
    steps_for_white += abs(starting_point_white[1] - price_coordinates[1])
    steps_for_black += abs(starting_point_black[0] - price_coordinates[0])
# if a < b then a is the first value we'll reach
elif price_coordinates[0] < price_coordinates[1]:
    steps_for_white += abs(starting_point_white[0] - price_coordinates[0])
    steps_for_black += abs(starting_point_black[1] - price_coordinates[1])
# if a == b then a and b will be reached the same time without any additional
# steps needed
else:
    steps_for_white += abs(starting_point_white[0] - price_coordinates[0]) # b could be also used here
    steps_for_black += abs(starting_point_black[0] - price_coordinates[0])
    

#print("# steps for white : "+str(steps_for_white))
#print("# steps_for_black : "+str(steps_for_black))

"""
if white and black has the same distance then white wins
if white has one step more than black then black wins
if white has one step less than black then white wins
"""

if steps_for_black >= steps_for_white:
    print("White")
elif steps_for_black < steps_for_white:
    print("Black")