4365: Game of Stones石头游戏

山姆一直在教乔恩《石头游戏》，以磨砺他的头脑，帮助他制定一个对抗白人步行者的策略。这个游戏的规则很简单：
    ·游戏从n堆石头开始，索引从1到n。第i堆石头包含si块石头。
    ·球员们交替移动。移动被认为是从一堆石头中移除一些石头。移除0块石头不算移动。
    ·无法移动的玩家将失败。
现在乔恩相信他已经准备好战斗了，但山姆并不这么认为。为了证明他的论点，山姆建议他们玩一个修改版的游戏。


在这个修改版本中，在一个桩上的移动不能超过一次。例如，如果从一堆石头中移除了4块石头，则无法再次从该堆石头中删除4块石头。


山姆开始了比赛，并做出了第一个动作。乔恩认为山姆只是想阻止他参加战斗。乔恩想知道如果两人都发挥出色，他是否能获胜。
Sam has been teaching Jon the Game of Stones to sharpen his mind and help him devise a strategy to fight the white walkers. The rules of this game are quite simple:

• The game starts with n piles of stones indexed from 1 to n. The i-th pile contains s_i stones.
• The players make their moves alternatively. A move is considered as removal of some number of stones from a pile. Removal of 0 stones does not count as a move.
• The player who is unable to make a move loses.

Now Jon believes that he is ready for battle, but Sam does not think so. To prove his argument, Sam suggested that they play a modified version of the game.
In this modified version, no move can be made more than once on a pile. For example, if 4 stones are removed from a pile, 4 stones cannot be removed from that pile again.
Sam sets up the game and makes the first move. Jon believes that Sam is just trying to prevent him from going to battle. Jon wants to know if he can win if both play optimally.

第一行由单个整数n(1 ≤ n ≤ 10⁶)-桩的数量。
接下来的n行中的每一行包含一个整数si(1 ≤ si ≤ 60)-第i个桩中的石头数量。

如果乔恩获胜，打印一行包含“YES”（不带引号），否则打印“NO”（不含引号）

1
5

NO