#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}


const int dig = 300;
using BS = bitset<dig>;

template<typename T>
struct Noshi{
	bool initialized;
	vector<T> a;
	int n, M, deg;
	vi memo;
	Noshi(vector<T> _a) : initialized(false), a(_a), n(_a.size()){
        if(is_same<T, int>::value) {M = 30;}
        else if(is_same<T, long long>::value) {M = 62;}
        else if(is_same<T, BS>::value) {M = dig - 1;}
        memo.resize(M + 1, -1);
	}
	void init(){
		initialized = true;
		deg = 0;
		for(int j = M; j >= 0; j--){
			int idx = -1;
			for(int i = deg; i < n; i++){
				if(((a[i] >> j) & (T)1) == (T)1){
					idx = i;
					break;
				}
			}
			if(idx >= 0){
				swap(a[idx], a[deg]);
				rep(i, n){
					if(i != deg){
						if(((a[i] >> j) & (T)1) == (T)1){
							a[i] ^= a[deg];
						}
					}
				}
				memo[j] = deg;
				deg++;
			}
		}
	}
	T get_max(){
		if(!initialized) init();
		T res = 0;
		for(int j = M; j >= 0; j--){
			if(memo[j] == -1) continue;
			if(((res >> j) & (T)1) == (T)0){
				res ^= a[memo[j]];
			}
		}
		return res;
	}
	int get_degree(){
		if(!initialized) init();
		return deg;
	}
	bool is_possible(T x){
		if(!initialized) init();
		T real = 0;
		for(int j = M; j >= 0; j--){
			if(((real >> j) & (T)1) != ((x >> j) &(T)1)){
				if(memo[j] == -1) return false;
				real ^= a[memo[j]];
			}
		}
		return true;
	}
};


int main(){
	int n;
	cin >> n;
	vector<int> a(n);
	cin >> a;
	{
		int tmp = 0;
		rep(i, n) tmp ^= a[i];
		if(tmp != 0){
			cout << "No\n";
			return 0;
		}
	}
	int x = a[n - 1];
	a.pop_back();
	Noshi<int> noshi(a);
	if(noshi.get_degree() < n - 1) cout << "Yes\n";
	else cout << "No\n";
	return 0;
}