#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    //鳩ノ巣原理より、N>=5001ならYes

    int N, M=8192, A, S=0;
    cin >> N;
    if (N >= 5001){
        cout << "Yes" << endl;
        return 0;
    }

    //dp(i): iを作る方法の総数
    //dp(0) >= 3ならばYes
    vector<int> dp(M);
    dp[0] = 1;

    for (int i=0; i<N; i++){
        cin >> A;
        S ^= A;
        vector<int> pd(M);
        for (int j=0; j<M; j++){
            pd[j] = min(3, pd[j]+dp[j]);
            pd[j^A] = min(3, pd[j^A]+dp[j]);
        }
        swap(dp, pd);
    }

    if (S != 0){
        cout << "No" << endl;
        return 0;
    }

    cout << (dp[0] == 3 ? "Yes" : "No") << endl;

    return 0;
}