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

int N;
int A[501010];
bool dp[5010][8192][2];
int main(void){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    cin >> N;
    int s = 0;
    for(int i = 0;i < N;i++){
        cin >> A[i];
        s ^= A[i];
    }
    if(s != 0){
        cout << "No\n";
        return 0;
    }
    if(N > 5000){
        cout << "Yes\n";
        return 0;
    }
    dp[1][A[0]][0] = true;
    for(int i = 1;i < N;i++){
        for(int j = 0;j < 8192;j++){
            for(int k = 0;k < 2;k++){
                dp[i + 1][j][1] |= dp[i][j][k];
                dp[i + 1][j ^ A[i]][k] |= dp[i][j][k];
            }
        }
    }

    cout << (dp[N][0][1] ? "Yes\n" : "No\n");
    return 0;
}