Be the Winner

Time Limit: 2 Seconds
Memory Limit: 65536 KB

Let's consider m apples divided into n groups. Each group contains no more
than 15 apples, arranged in a line. You can take any number of consecutive apples
at one time.

For example "@@@" can be turned into "@@" or "@"
or "@ @"(two piles).

Two people get apples one after another and the one who takes the last is the
loser.

Fra wants to know in which situations he can win by playing strategies (that
is, no matter what action the rival takes, fra will win).

**Input**

You will be given several cases. Each test case begins with a single number
n (1 <= n <= 3), followed by a line with n numbers, the number of apples
in each pile. There is a blank line between cases.

**Output**

If a winning strategies can be found, print a single line with "Yes",
otherwise print "No".

**Sample Input**

2

2 2

1

3

**Sample Output**

No

Yes

Author:

**ZHOU, Qiang**
Source:

**Zhejiang University 2003 Summer Camp Qualification Contest**
Submit
Status