
ZOJ Problem Set  2083
A and B play a game. There are n lines. A and B color them by turns (A first). One can only color a segment of a line, with length 2, which has not be colored, and the distance between a segment end point and the line's end point is a interger. When one can not color, he loses.
There are several test cases. The first line of a case is a positive interger n, the next line contain n positive intergers, represent the lengths of the n lines. The sum of the lengths do not exceed 50.
If A can win output a "Yes", else output a "No". Note: you should consider A and B a clever enough.
2
Yes
Author: CHEN, Gaoli Source: ZOJ Monthly, February 2004 