#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int N;
    cin >> N;
    vector<int> A(N);
    for (int i = 0; i < N; ++i) {
        cin >> A[i];
    }

    int now = 0;
    for (int a : A) {
        now ^= a;
    }
    if (now != 0) {
        cout << "No" << endl;
        return 0;
    }

    if (N > 5000) {
        cout << "Yes" << endl;
        return 0;
    }

    vector<int> dp(8192, 0);
    dp[0] = 1;
    for (int a : A) {
        vector<int> ndp = dp;
        for (int i = 0; i < 8192; ++i) {
            ndp[i ^ a] += dp[i];
        }
        swap(dp, ndp);
    }
    if (dp[0] >= 3) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }

    return 0;
}