Module: Nested conditional statement. Difficult conditions


Problem

10 /13


Knight's move

Problem

Knight is the most mysterious figure in a chess game. The main distinguishing feature — change the color of the field with each move. 
It is required to determine whether a knight standing on a cell with the specified coordinates (row number and column number) can beat a piece standing on another specified cell.

Input
Four numbers are entered: the coordinates of the knight and the coordinates of another figure. Coordinates are integers between 1 and 8.

Imprint
It is required to output the word YES if the knight can capture the piece in 1 move, otherwise output the word NO.

 

Examples
# Input Output
1 1
1
2
3
YES
2 3
2
8
3
NO