// #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")

// #include <bits/extc++.h>
// using namespace __gnu_pbds;

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

#define int long long
#define double long double
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;

#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back

#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define RANDOM() random_device __rd; \
                 mt19937 __gen = mt19937(__rd()); \
                 uniform_int_distribution<int> __dis(0, 1); \
                 auto rnd = bind(__dis, __gen);

const int INF = 1E18;
const int mod = 1E9 + 7;

int32_t main() {
    fastIO();
    
    int n;
    cin >> n;
    
    vector<int> v(n);
    for (auto &x : v) cin >> x;
    sort(ALL(v));
    
    if (n % 3 == 0) {
        if ((v[0] ^ v[n/3]) != v[2*n/3]) return cout << "No\n", 0;
        for (int i =       1; i <   n/3; ++i) if (v[i] != v[i-1]) return cout << "No\n";
        for (int i =   n/3+1; i < 2*n/3; ++i) if (v[i] != v[i-1]) return cout << "No\n";
        for (int i = 2*n/3+1; i <   n  ; ++i) if (v[i] != v[i-1]) return cout << "No\n";
        return cout << "Yes\n", 0;
    }
    else for (auto x : v) if (x) return cout << "No\n", 0;
    
    return 0;
}