#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, n, a) for (int i = (int)(n); i >= (int)(a); i--)

void solve(){
    int n; cin >> n;
    vector<int> a(pow(2,n));
    rep(i,0,pow(2,n)) cin >> a[i];
    if(a[0] != 0){
        cout << "No";
        return;
    }
    rep(i,0,n){
        rep(j,0,n){
            int k = i ^ (1<<j);

            if(k < n){
                if(a[i]^a[1<<j] != a[k]){
                    cout << "No";
                    return;
                }
            }
        }
        
    }
    cout << "Yes";
    return;
}

int main(){

    int t = 1;
    //cin >> t;
    rep(i,0,t) solve();

    return 0;
}