import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum E = 30;

int[] solve(const(int) N, const(int[]) A) {
  foreach (e0; -1 .. E) {
    if (~A[0]) {
      if (e0 != (A[0] ? bsr(A[0]) : -1)) {
        continue;
      }
    }
    debug {
      writeln("e0 = ", e0);
    }
    auto as = A.dup;
    foreach (i; 0 .. 1 << N) {
      if (!~A[i]) {
        as[i] = (1 << E) - 1;
      }
    }
    foreach_reverse (e; e0 + 1 .. E) {
      int[] basis;
      foreach (i; 0 .. 1 << N) {
        if (~A[i] && !((A[i] >> e) & 1)) {
          int x = i;
          foreach (y; basis) {
            chmin(x, x ^ y);
          }
          if (x) {
            basis ~= x;
          }
        }
      }
      debug {
        writeln("  e = ", e, ": ", basis);
      }
      const dim = cast(int)(basis.length);
      auto sums = new int[1 << dim];
      foreach (d; 0 .. dim) {
        foreach (h; 0 .. 1 << d) {
          sums[h | 1 << d] = sums[h] ^ basis[d];
        }
      }
      foreach (h; 0 .. 1 << dim) {
        as[sums[h]] &= ~(1 << e);
      }
    }
    if (~e0) {
      foreach (i; 0 .. 1 << N) {
        as[i] |= 1 << e0;
      }
    }
    bool ok = true;
    foreach (i; 0 .. 1 << N) {
      if (~A[i]) {
        ok = ok && (A[i] == as[i]);
      }
    }
    foreach (i; 0 .. 1 << N) foreach (j; 0 .. 1 << N) {
      // ok = ok && (A[i ^ j] >= (A[i] ^ A[j]));
    }
    if (ok) {
      return as;
    }
  }
  return null;
}

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto A = new int[1 << N];
      foreach (i; 0 .. 1 << N) {
        A[i] = readInt();
      }
      
      const ans = solve(N, A);
      
      if (ans) {
        writeln("Yes");
        foreach (i; 0 .. 1 << N) {
          if (i > 0) write(" ");
          write(ans[i]);
        }
        writeln;
      } else {
        writeln("No");
      }
    }
  } catch (EOFException e) {
  }
}