The field of the chessboard is defined by a pair of numbers (a, b), each from 1 to 8, the first number specifies the column number, the second – line number. Two cells are given. Determine if the chess king can get from the first cell to the second in one move.
Input
Given 4 integers from 1 to 8 each, the first two define the starting cell, the second two define the final cell. The start and end cells do not match. Numbers are written on separate lines.
Imprint
The program should print YES if it is possible to get to the second one from the first cell by the king's move, or NO otherwise.
Examples
| # |
Input |
Output |
| 1 |
4
4
5
5 |
YES |