#include <cstring>

#include <iostream>

#include <algorithm>

#include <unordered_set>

using namespace std;

const int N = ;

int n;

int f[N];

int sg(int x) {

    if (f[x] != -) return f[x];

    unordered_set<int> S;

    for (int i = ; i < x; i ++ )

        for (int j = ; j <= i; j ++ )

            S.insert(sg(i) ^ sg(j));

    for (int i = ;; i ++ )

        if (!S.count(i))

            return f[x] = i;

}

int main() {

    cin >> n;

    memset(f, -, sizeof f);

    int res = ;

    while (n -- ) {

        int x;

        cin >> x;

        res ^= sg(x);

    }

    if (res) puts("Yes");

    else puts("No");

    return ;

}