Little Petya loves playing with squares. Mum bought him a square 2*n* × 2*n* in size. Petya marked a cell inside the square and now he is solving the following task.

The task is to draw a broken line that would go along the grid lines and that would cut the square into two equal parts. The cutting line should not have any common points with the marked cell and the resulting two parts should be equal up to rotation.

Petya wants to determine whether it is possible to cut the square in the required manner given the sizes of the square side and the coordinates of the marked cell. Help him.
The first line contains three space-separated integers 2*n*, *x* and *y* (2 ≤ 2*n* ≤ 100, 1 ≤ *x*, *y* ≤ 2*n*), representing the length of a square's side and the coordinates of the marked cell. It is guaranteed that 2*n* is even.

The coordinates of the marked cell are represented by a pair of numbers *x* *y*, where *x* represents the number of the row and *y* represents the number of the column. The rows and columns are numbered by consecutive integers from 1 to 2*n*. The rows are numbered from top to bottom and the columns are numbered from the left to the right.
4 1 1
YES
2 2 2
NO
8 2 5
YES
6 1 6
YES
2 1 1
NO
2 1 2
NO
2 2 1
NO
4 2 2
NO
4 2 3
NO
4 2 4
YES
60 30 30
NO
60 34 30
YES
60 31 29
YES
100 61 30
YES
100 52 50
YES
100 51 51
NO
100 1 2
YES
100 1 8
YES
100 19 99
YES
100 18 82
YES
100 100 50
YES
100 51 100
YES
100 100 100
YES
6 3 3
NO
6 4 4
NO
6 3 1
YES
6 3 5
YES
8 4 4
NO
6 3 2
YES
4 3 3
NO
20 10 1
YES
8 4 1
YES
100 50 50
NO
n, x, y = map(int, input().split())
notOK = x in [n, n+1] and y in [n, n+1]
print(["YES","NO"][notOK])