7107번 - Journey of A Knight 다국어

문제

The size of a right-angled cell board is n*m cells. The chess knight is located in the left bottom cell of the board (coordinates 1;1), as shown in pic.1.

The chess knight can move according to the chess rules - during each turn it can move according to the chess rules- either one cell in the vertical direction and one in horizontal or vice versa.

Thus, for example, if n=4 and m=3 and the knight is located in the cell (2;1) (see pic.2), then with the next turn it can move in any of the following cells : (1;3),(3;3) or (4;2).

For the given natural numbers n,m,i,j (n<=100,m<=100,i<=n,j<=m) given in the input your task is to determine and output, which is the least possible number of moves for the knight to reach the cell (i;j), starting from the cell (1;1).

If it is not possible to reach this cell, output one single word "NEVAR".

Pic. 1

Pic. 2

입력

출력

제한

힌트