ENG  RUS Timus Online Judge
Online Judge
Problems
Authors
Online contests
Site news
Webboard
Problem set
Submit solution
Judge status
Guide
Register
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules

Contest is over

G. Pawn Game

Time limit: 1.0 second
Memory limit: 64 MB
In their free time, Santa Claus Petrovich and Santa Claus Egorych play the following game. Pawns are arranged on a board 3×3 in the following way:
Pawns move and attack according to the standard chess rules, and there is one additional rule: it is obligatory to attack. The one who cannot make a move loses. White moves first. For the last 100 years, Petrovich have been playing white and he always won. Once Egorych became tired of this and brought a board 3×5. But he again was losing constantly playing black. "What's the matter", he thought and decided to buy a board 3×N:
And here Petrovich has to think which color to play in order to win. Help him to decide.

Input

The integer N (1 ≤ N ≤ 109).

Output

"White" if Petrovich should play white, and "Black" if he should play black. Egorych and Petrovich always make moves according to their optimal strategies.

Samples

inputoutput
```3
```
```White
```
```4
```
```Black
```
```5
```
```White
```
Problem Author: Alexander Toropov
Problem Source: Ural SU Contest. Petrozavodsk Winter Session, January 2006
To submit the solution for this problem go to the Problem set: 1465. Pawn Game