#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>

using namespace std;

int I() {
    int x;
    cin >> x;
    return x;
}

vector<int> LI() {
    int n = I();
    vector<int> vec(n);
    for (int i = 0; i < n; ++i) {
        cin >> vec[i];
    }
    return vec;
}

int main() {
    int n = I();
    vector<int> a = LI();
    
    unordered_map<int, int> a_cnt;
    for (int i = 0; i < n; ++i) {
        a_cnt[a[i]]++;
    }

    unordered_map<int, long long> dp;
    dp[0] = 1;
    for (auto &[num, count] : a_cnt) {
        unordered_map<int, long long> ndp;
        int mul = 1 << (count - 1);
        for (auto &[val, cnt] : dp) {
            ndp[val] += cnt * mul;
            ndp[val ^ num] += cnt * mul;
        }
        dp = ndp;
    }

    if (dp[0] == 2) {
        cout << "No" << endl;
    } else {
        cout << "Yes" << endl;
    }

    return 0;
}