#37Medium

Knight move

Time: 1 s · Memory: 256 MB

Conditionals

Statement

The files and ranks of a chessboard are numbered from $1$ to $8$ . A knight stands on square $(x_1, y_1)$ . Can it reach square $(x_2, y_2)$ in one move?

A knight moves in an "L" shape: $2$ squares in one direction and $1$ square in the perpendicular direction.

Input format

A single line with four integers $x_1$ , $y_1$ , $x_2$ , $y_2$ ( $1 \le x_i, y_i \le 8$ ).

Output format

YES if it can, NO otherwise.

Examples

Input

1 1 2 3

Output

YES

Input

1 1 3 3

Output

NO

Note

Compute the differences $|x_1 - x_2|$ and $|y_1 - y_2|$ : for a knight move one of them is $1$ and the other is $2$ . Staying on the same square is not a move.

Knight move

Time: 1 s · Memory: 256 MB

Conditionals

Statement

The files and ranks of a chessboard are numbered from $1$ to $8$ . A knight stands on square $(x_1, y_1)$ . Can it reach square $(x_2, y_2)$ in one move?

A knight moves in an "L" shape: $2$ squares in one direction and $1$ square in the perpendicular direction.

Input format

A single line with four integers $x_1$ , $y_1$ , $x_2$ , $y_2$ ( $1 \le x_i, y_i \le 8$ ).

Output format

YES if it can, NO otherwise.

Examples

Input

1 1 2 3

Output

YES

Input

1 1 3 3

Output

NO

Note

Compute the differences $|x_1 - x_2|$ and $|y_1 - y_2|$ : for a knight move one of them is $1$ and the other is $2$ . Staying on the same square is not a move.