In the universe VA-517-DIM in the solar system FST-1-LUS on the planet FRE-237-SU, a competition is taking place within the “Parkour” civilization between two noobs, the winner of which will receive a steak, while the loser — will only get a chicken. The first noob is named Blue, and the second — Red. This competition takes place on a field of size 2 × N. Initially, Blue stands on cell (r₁, c₁), and Red stands on cell (r₂, c₂). They take turns moving, starting with the first player, as follows: a player jumps to a cell adjacent by side to his current position, which neither player has visited before, and they cannot jump to the cell where the opponent currently stands. If a noob cannot make a move, he loses and receives the shameful chicken.

Both Blue and Red want to get the steak, so they will do everything possible to win. Determine which of the noobs will win with optimal play.

The first line contains an integer N — the size of the field (3 ≤ N ≤ 10⁹).

The second line contains two integers r₁ and c₁ — the starting cell of Blue (1 ≤ r₁ ≤ 2, 1 ≤ c₁ ≤ N).

The third line contains two integers r₂ and c₂ — the starting cell of Red (1 ≤ r₂ ≤ 2, 1 ≤ c₂ ≤ N).

It is guaranteed that the starting cells of the players are different.

Output the name of the winner with optimal play.