#include <bits/stdc++.h>

using namespace std;
void fast_io() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
}

int main() {
    fast_io();
    int n;
    cin >> n;
    vector<int> a(n);
    int su = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        su ^= a[i];
    }
    if (su) {
        cout << "No\n";
        return 0;
    }
    sort(a.begin(), a.end());
    if (n == 2 && a[1] != 0) {
        cout << "No\n";
    }
    for (int i = 0; i < n - 1; i++) {
        if (a[i] == a[i + 1]) {
            cout << "Yes\n";
            return 0;
        }
    }
    vector<vector<int>> dp(n + 1, vector<int>(8192, 0));
    dp[0][0] = 1;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 8192; j++) {
            dp[i + 1][j] += dp[i][j];
            dp[i + 1][j] = min(3, dp[i + 1][j]);
            dp[i + 1][j ^ a[i]] += dp[i][j];
            dp[i + 1][j ^ a[i]] = min(3, dp[i + 1][j ^ a[i]]);
        }
    }
    if (dp[n][0] > 2) {
        cout << "Yes\n";
    } else {
        cout << "No\n";
    }
}