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)); } void main() { try { for (; ; ) { const N = readInt(); auto A = new int[1 << N]; foreach (i; 0 .. 1 << N) { A[i] = readInt(); } auto as = A.dup; foreach (i; 0 .. 1 << N) { if (!~A[i]) { as[i] = (1 << 30) - 1; } } foreach_reverse (e; 0 .. 30) { for (; ; ) { bool upd; foreach (i; 0 .. 1 << N) foreach (j; 0 .. 1 << N) { const k = i ^ j; if (!(as[k] >= (as[i] ^ as[j]))) { if (i != k && !~A[i] && ((as[i] >> e) & 1)) { as[i] ^= 1 << e; upd = true; } if (j != k && !~A[j] && ((as[j] >> e) & 1)) { as[j] ^= 1 << e; upd = true; } } } if (!upd) { break; } } } bool ok = true; foreach (i; 0 .. 1 << N) foreach (j; 0 .. 1 << N) { const k = i ^ j; ok = ok && (as[k] >= (as[i] ^ as[j])); } if (ok) { writeln("Yes"); foreach (i; 0 .. 1 << N) { if (i > 0) write(" "); write(as[i]); } writeln; } else { writeln("No"); } } } catch (EOFException e) { } }