#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll=long long;
using ld=long double;
using uint=uint32_t;
using ull=uint64_t;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using mint=modint998244353;
const ll INF=1ll<<60;

//xor基底(msbがdistinct)

vector<ll> xor_base(vector<ll> A){
  vector<ll> base;
  for(ll v:A){
    for(ll e:base)v=min(v,v^e);
    if(v>0)base.emplace_back(v);
  }
  sort(base.begin(),base.end());
  int n=base.size();
  for(int i=n-2;i>=0;i--){
    int msb=-1;
    for(int j=0;j<60;j++){
      if(base[i]&(1ll<<j))msb=max(msb,j);
    }
    for(int j=i+1;j<n;j++){
      if(base[j]&(1ll<<msb))base[j]^=base[i];
    }
  }
  return base;
}

int main(){
  int N; cin>>N;
  vector<ll> A(N);
  ll sum=0;
  for(int i=0;i<N;i++){
    cin>>A[i];
    sum^=A[i];
  }
  if(sum!=0){
    cout<<"No"<<endl;
    return 0;
  }
  vector<ll> base=xor_base(A);
  int n=base.size();
  if(n<N-1)cout<<"Yes"<<endl;
  else cout<<"No"<<endl;
  return 0;
}