Chessboard

Interview

Time limit2sMemory limit512 MB

Summary

Given an m by n chessboard and the color of one cell, decide whether black, white, or neither appears more often.

Level: Easy2 of 10
Topics: Math, Implementation, Brute force
Solved: No attempts yet

Problem

Anya divided a board of size $m \times n$ into cells of size $1 \times 1$ and colored them black and white in a chessboard pattern. Vasya wondered which color appeared more often on the board, black or white.

To find out, he asked Anya what color she had used for the cell in row $i$ , column $j$ of the board. From this information Vasya tried to determine which color appears more often on the board.

Given the size of the board and the color of the cell in row $i$ , column $j$ , write a program that determines which color appears more often on the board, black or white.

Input

The input file contains five integers: $m$ , $n$ , $i$ , $j$ , and $c$ ( $1 \le m, n \le 10^9$ , $1 \le i \le m$ , $1 \le j \le n$ , $c = 0$ or $c = 1$ ). The value $c = 0$ means that the cell in row $i$ , column $j$ of the board is colored black, and $c = 1$ means it is colored white.

Output

The output file must contain one of three words:

black, if the board has more black cells,
white, if the board has more white cells,
equal, if the board has the same number of black and white cells.

Examples3

Example 1
Input
```
3 5 1 1 0
```
Expected output
```
black
```
Example 2
Input
```
3 5 2 1 0
```
Expected output
```
white
```
Example 3
Input
```
4 4 1 1 1
```
Expected output
```
equal
```