Codeforces Beta Round 85 (Div. 2 Only)
B
Petya and Square
Codeforces
1200
原题
← AC →
翻译中…

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.

翻译中…

Input

翻译中…

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.

翻译中…

Output

翻译中…

If the square is possible to cut, print "YES", otherwise print "NO" (without the quotes).

翻译中…

Note

翻译中…

A sample test from the statement and one of the possible ways of cutting the square are shown in the picture:

翻译中…

image

翻译中…

样例

Input #1
4 1 1
Output #1
YES
InputCopy OutputCopy
Input #2
2 2 2
Output #2
NO
InputCopy OutputCopy
题目信息
题号
112B
时间限制
2 s
内存限制
256 MB
标签
模拟
数学

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。