#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 300010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 29;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

int N, A[MAX_N];
int L[MAX_N], R[MAX_N];
vector<pi> query[MAX_N];
bool ok[MAX_N];

void solve() {
	cin >> N;
	rep(i, 0, (1 << N)) L[i] = -1;
	rep(i, 0, (1 << N)) R[i] = inf;
	rep(i, 0, (1 << N)) {
		cin >> A[i]; A[i]--;
		if(A[i] != -1) ok[A[i]] = true;
	}
	if(A[0] != -1 && A[0] != 0) {
		cout << "NO\n";
		return;
	}
	if(A[(1 << N) - 1] != -1 && A[(1 << N) - 1] != (1 << N) - 1) {
		cout << "NO\n";
		return;
	}

	A[0] = 0; 
	A[(1 << N) - 1] = (1 << N) - 1;
	ok[0] = true; ok[(1 << N) - 1] = true;

	rep(i, 0, (1 << N)) {
		rep(j, 0, N) {
			if(!(i & (1 << j))) continue;
			MAX(L[i], L[i ^ (1 << j)]);
		}
		if(A[i] != -1) {
			if(L[i] >= A[i]) {
				cout << "NO\n";
				return;
			}
			else L[i] = A[i];
		}
	}
	rer(i, (1 << N), 0) {
		rep(j, 0, N) {
			if(i & (1 << j)) continue;
			MIN(R[i], R[i | (1 << j)]);
		}
		if(A[i] != -1) {
			if(R[i] <= A[i]) {
				cout << "NO\n";
				return;
			}
			else R[i] = A[i];
		}
	}
	rep(i, 0, (1 << N)) {
		if(L[i] >= R[i]) continue;
		query[L[i]].pb(pi(R[i], i));
	}
	// rep(i, 0, (1 << N)) debug(i, L[i], R[i]);
	// rep(i, 0, (1 << N)) debug(i, query[i]);

	set<pi> S;
	rep(i, 0, (1 << N)) {
		vector<pi>& vec = query[i];
		rep(j, 0, sz(vec)) S.insert(vec[j]);
		if(ok[i]) continue;
		if(S.empty()) {
			cout << "NO\n";
			return;
		}
		A[S.begin()->sec] = i;
		S.erase(S.begin());
		if(!S.empty() && S.begin()->fst <= i) {
			cout << "NO\n";
			return;
		}
	}
	// debug(vi(A, A + (1 << N)));
	cout << "YES\n";
	rep(i, 0, (1 << N)) {
		int tmp = 0;
		rep(j, 0, N) {
			if(!(i & (1 << j))) continue;
			tmp |= (1 << (N - 1 - j));
		}
		cout << A[tmp] + 1 << " ";
	}
	cout << "\n";
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
	srand((unsigned int)time(NULL));
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}



Measured memory_bytes: 24824