#include <bits/stdc++.h>
using namespace std;

int main() {
    int N;
    cin >> N;

    vector<int> A(N);
    for (int &x : A) cin >> x;

    int xorsum = 0;
    for (int &x : A) xorsum ^= x;

    if (xorsum) {
        cout << "No" << endl;
        return 0;
    }

    vector<vector<long long> > dp(N + 1, vector<long long>(9000, 1e9));
    dp[1][A[0]] = 1;
    for (int i = 2; i <= N; i++) {
        int a = A[i - 1];
        for (int x = 0; x < 9000; x++) {
            dp[i][x] = min(dp[i - 1][x], dp[i - 1][x ^ a] + 1);
        }
    }
    if (dp[N][0] < N) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }

    return 0;
}