#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


void solve(){
    int n; cin >> n;
    vector<int> a(n);
    for(int i=0; i<n; i++) cin >> a[i];
    int all_xor = 0;
    for(int i=0; i<n; i++) all_xor ^= a[i];
    if(all_xor != 0){
        cout << "No\n";
        return;
    }

    if(n>5001){
        cout << "Yes\n";
        return;
    }

    int MAX = 1<<13;
    vector<vector<vector<bool>>> dp(2, vector<vector<bool>>(MAX, vector<bool>(2, false)));
    auto crt = dp[0], nxt = dp[1];
    crt[a[0]][1] = true;
    for(int i=1; i<n-1; i++){
        nxt[a[i]][0] = true;
        for(int j=0; j<MAX; j++){
            nxt[j^a[i]][0] = nxt[j^a[i]][0]|crt[j][0];
            nxt[j][0] = nxt[j][0] | crt[j][0] | crt[j][1];
            nxt[j^a[i]][1] = crt[j][1];
        }

        //check
        if(nxt[0][0]||nxt[0][1]){
            cout << "Yes\n";
            return;
        }

        swap(crt, nxt);
        for(int j=0; j<MAX; j++) nxt[j][0]=nxt[j][1]=false;
    }

    if(crt[a[n-1]][0]){
        cout << "Yes\n";
        return;
    }

    cout << "No\n";
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}