The third one is extra
Zhenya, Zhenyechka, and Yevhen are playing an intriguing game. On the table, there are candies of n different types. In each turn, a player can choose any one type of candy and eat any number of candies of that type. The turns proceed in the order: Zhenya, Zhenyechka, and then Yevhen. The player who takes the last candy wins the game.
Zhenya is determined to help his friend Zhenyechka win the game. Can he ensure her victory regardless of her moves and Yevhen's lack of participation?
Input
The first line of input contains an integer n, representing the number of candy types. The following line lists natural numbers a_1, a_2, ..., a_n, which indicate the quantities of candies for each type. The condition (a_1 + 1) (a_2 + 1) ... (a_n + 1) ≤ 100 must be satisfied.
Output
Print "Yes" if Zhenya can ensure Zhenyechka's victory, or "No" if he cannot.