//#define NDEBUG
#pragma warning(disable : 4146)

#include <algorithm>
#include <cassert>
#include <cstddef>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;
using f64 = double;

struct rep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
struct revrep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
  return a < b ? b - a : a - b;
}
template <class T> void chmin(T &a, const T &b) noexcept {
  if (b < a)
    a = b;
}
template <class T> void chmax(T &a, const T &b) noexcept {
  if (a < b)
    a = b;
}
template <class F> class rec_lambda {
  F f;

public:
  rec_lambda(F &&f_) : f(std::forward<F>(f_)) {}
  template <class... Args> auto operator()(Args &&... args) const {
    return f(*this, std::forward<Args>(args)...);
  }
};
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}
constexpr char eoln = '\n';
template <class T> T ceildiv(const T &l, const T &r) {
  return l / r + (l % r != 0 ? 1 : 0);
}

#ifdef N91_LOCAL
#define OJ_LOCAL(a, b) b
#else
#define OJ_LOCAL(a, b) a
#endif

} // namespace n91

#include <array>

namespace n91 {

void main_() {
  const usize N = scan<usize>();

  std::vector<i32> A(1 << N);
  for (auto &e : A) {
    std::cin >> e;
  }

  std::vector<u32> ans(1 << N);
  for (const usize i : rep(0, 1 << N)) {
    if (A[i] == -1) {
      ans[i] = (1 << 30) - 1;
    } else {
      ans[i] = A[i];
    }
  }

  for (const usize p : rep(0, 30)) {
    std::vector<int> state(1 << N);
    for (const usize i : rep(0, 1 << N)) {
      if (A[i] == -1) {
        state[i] = -1;
      } else {
        state[i] = A[i] >> p & 1;
      }
    }
    bool changed = true;
    while (changed) {
      changed = false;
      for (const usize i : rep(0, 1 << N)) {
        for (const usize j : rep(0, 1 << N)) {
          const usize k = i ^ j;
          if (!((ans[i] & ans[j] & ans[k]) >> (p + 1)) && state[i] == 0 &&
              state[j] == 0) {
            if (state[k] == 1) {
              std::cout << "No" << eoln;
              return;
            } else if (state[k] == -1) {
              state[k] = 0;
              ans[k] &= !static_cast<u32>(1 << p);
              changed = true;
            }
          }
        }
      }
    }
  }

  std::cout << "Yes" << eoln;
  for (const usize i : rep(0, 1 << N)) {
    std::cout << ans[i] << " \n"[i + 1 == (1 << N)];
  }
}

} // namespace n91

int main() {
  //*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/
  std::cout << std::setprecision(20);
  n91::main_();
  return 0;
}