#include<bits/stdc++.h>

using namespace std;

int main() {
  int N;
  cin >> N;
  vector< int > A(1 << N);
  for(auto &a : A) cin >> a;
  vector< int > B{A};
  for(auto &b : B) if(b == -1) b = (1 << 30) - 1;

  vector< tuple< int, int, int > > mada;
  for(int i = 0; i < (1 << N); i++) {
    for(int j = 0; j <= i; j++) {
      mada.emplace_back(i, j, i ^ j);
    }
  }
  // すみません　計算量を何も考えていません
  for(int i = 29; i >= 0; i--) {
    bool update = true;
    while(update) {
      update = false;
      for(auto&[a, b, c] : mada) {
        int one = 0;
        one += (B[a] >> i) & 1;
        one += (B[b] >> i) & 1;
        one += (B[c] >> i) & 1;
        if(one == 1) {
          if((B[a] >> i) & 1) B[a] ^= 1 << i;
          if((B[b] >> i) & 1) B[b] ^= 1 << i;
          if((B[c] >> i) & 1) B[c] ^= 1 << i;
          update = true;
        }
      }
    }
    vector< tuple< int, int, int > > nxt;
    for(auto&[a, b, c]:mada) {
      int one = 0;
      one += (B[a] >> i) & 1;
      one += (B[b] >> i) & 1;
      one += (B[c] >> i) & 1;
      if(one != 3) {
        nxt.emplace_back(a, b, c);
      }
    }
    mada = move(nxt);
  }
  for(int i = 0; i < (1 << N); i++) {
    if(~A[i] and A[i] != B[i]) {
      cout << "No\n";
      return 0;
    }
  }
  cout << "Yes\n";
  for(int i = 0; i < (1 << N); i++) {
    if(i) cout << " ";
    cout << B[i];
  }
  cout << "\n";
}