时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
ZYT and LBC decided to play a game.
They will alternately do the following operation.
-
Pick 4 integers
and
, where
, and draw a straight segment between point
and point
. The segment shouldn't overlap with a segment that already exists.
-
In any time, the segments shouldn't form a polygon. That is, there exists no sequence of distinct points
satisfying for each integer
，there is a segment between
and
.
The player who can't perform an operation during his move loses.
Determine whether ZYT can win considering that both players play optimally and ZYT starts.
输入描述:
The input consists of one line containing two integersand
.
输出描述:
Print "YES"(without quote) if ZYT can win and "NO"(without quote) if ZYT can't.
备注:
It is guaranteed that.