#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class t, class u>
void chmax(t& first, u second) {
  if (first < second) first = second;
}
template <class t, class u>
void chmin(t& first, u second) {
  if (second < first) first = second;
}
template <class t>
using vc = vector<t>;
template <class t>
using vvc = vc<vc<t>>;
using pi = pair<ll, ll>;
using vi = vc<ll>;
template <class t, class u>
ostream& operator<<(ostream& os, const pair<t, u>& p) {
  return os << "{" << p.first << "," << p.second << "}";
}
template <class t>
ostream& operator<<(ostream& os, const vc<t>& v) {
  os << "{";
  for (auto e : v) os << e << ",";
  return os << "}";
}
using uint = unsigned;
using ull = unsigned long long;
template <ll i, class T>
void print_tuple(ostream&, const T&) {}
template <ll i, class T, class H, class... Args>
void print_tuple(ostream& os, const T& t) {
  if (i) os << ",";
  os << get<i>(t);
  print_tuple<i + 1, T, Args...>(os, t);
}
template <class... Args>
ostream& operator<<(ostream& os, const tuple<Args...>& t) {
  os << "{";
  print_tuple<0, tuple<Args...>, Args...>(os, t);
  return os << "}";
}
void print(ll x, ll suc = 1) {
  cout << x;
  if (suc == 1) cout << endl;
  if (suc == 2) cout << " ";
}
ll read() {
  ll i;
  cin >> i;
  return i;
}
vi readvi(ll n, ll off = 0) {
  vi v(n);
  for (ll i = ll(0); i < ll(n); i++) v[i] = read() + off;
  return v;
}
template <class T>
void print(const vector<T>& v, ll suc = 1) {
  for (ll i = ll(0); i < ll(v.size()); i++)
    print(v[i], i == ll(v.size()) - 1 ? suc : 2);
}
string readString() {
  string s;
  cin >> s;
  return s;
}
template <class T>
T sq(const T& t) {
  return t * t;
}
void yes(bool ex = true) {
  cout << "yes" << endl;
  if (ex) exit(0);
}
void no(bool ex = true) {
  cout << "no" << endl;
  if (ex) exit(0);
}
constexpr ll ten(ll n) { return n == 0 ? 1 : ten(n - 1) * 10; }
const ll infLL = LLONG_MAX / 3;
const ll inf = infLL;
ll topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
ll topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
ll popcount(signed t) { return __builtin_popcount(t); }
ll popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(ll i) { return i && (i & -i) == i; }
bool inc(ll first, ll second, ll c) { return first <= second && second <= c; }
template <class t>
void mkuni(vc<t>& v) {
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
}
ll rand_int(ll l, ll r) {
  static random_device rd;
  static mt19937 gen(rd());
  return uniform_int_distribution<ll>(l, r)(gen);
}
vi waf(vi first, ll bc) {
  vi second;
  for (ll i = ll(0); i < ll(first.size()); i++) {
    second.push_back(i);
    ll s;
    while ((s = second.size()) >= 3) {
      ll x = second[s - 3], y = second[s - 2], z = second[s - 1];
      bool upd = false;
      if (first[y] != -1) {
        if (first[x] == -1 && first[z] != -1) {
          upd = true;
          first[x] = first[z];
        } else if (first[x] != -1 && first[z] == -1) {
          upd = true;
          first[z] = first[x];
        }
      }
      if (!upd) break;
      second.pop_back();
      second.pop_back();
    }
  }
  for (ll i = 1; i < ll(second.size()); i += 2) first[second[i]] = bc;
  return first;
}
vi sub(ll n, vi first) {
  ll s = first.size();
  vi nx(s, -1);
  vvc<ll> pos(n);
  for (ll i = ll(0); i < ll(s); i++)
    if (first[i] != -1) pos[first[i]].push_back(i);
  for (ll i = ll(0); i < ll(n); i++)
    for (ll j = ll(0); j < ll(pos[i].size()); j++)
      if (pos[i][j] % 2 != pos[i][0] % 2) no();
  vc<pi> lr;
  for (ll i = ll(0); i < ll(n); i++)
    for (ll j = ll(0); j < ll(ll(pos[i].size()) - 1); j++) {
      lr.emplace_back(pos[i][j], pos[i][j + 1]);
      nx[pos[i][j]] = pos[i][j + 1];
    }
  sort(lr.begin(), lr.end(),
       [](pi x, pi y) { return x.second - x.first < y.second - y.first; });
  vi rem;
  for (ll i = ll(0); i < ll(n); i++)
    if (pos[i].empty()) rem.push_back(i);
  for (auto w : lr) {
    ll l = w.first, r = w.second;
    ll cur = l + 1;
    vi z;
    while (cur < r) {
      while (nx[cur] != -1) cur = nx[cur];
      if (cur > r) no();
      z.push_back(first[cur]);
      cur++;
    }
    ll cnt = (z.size() + 1) / 2;
    for (auto v : z)
      if (v != -1) cnt--;
    if (cnt < 0) no();
    for (auto& v : z)
      if (v == -1 && cnt) {
        v = rem.back();
        rem.pop_back();
        cnt--;
      }
    vi second = waf(z, first[l]);
    cur = l + 1;
    for (ll i = ll(0); i < ll(second.size()); i++) {
      while (nx[cur] != -1) cur = nx[cur];
      first[cur++] = second[i];
    }
  }
  return first;
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout << fixed << setprecision(20);
  ll n;
  cin >> n;
  if (n == 1) {
    yes(0);
    print(1);
    return 0;
  }
  ll s = n * 2 - 1;
  vi first = readvi(s, -1);
  if (first[0] != -1 && first[s - 1] != -1 && first[0] != first[s - 1]) no();
  if (first[0] == -1 && first[s - 1] != -1) first[0] = first[s - 1];
  first.pop_back();
  ll o = -1;
  for (ll i = ll(0); i < ll(s - 1); i++)
    if (first[i] != -1) {
      o = i;
      break;
    }
  if (o == -1) {
    first[0] = 0;
    o = 0;
  } else {
    for (ll i = ll(0); i < ll(s - 1); i++) {
      if (i + o < s - 1)
        first[i] = first[i + o];
      else
        first[i] = -1;
    }
  }
  first.push_back(first[0]);
  void(0);
  vi ans = sub(n, first);
  ans.pop_back();
  yes(0);
  for (ll i = ll(0); i < ll(s); i++) {
    ll j = (i + s - 1 - o) % (s - 1);
    print(ans[j] + 1, i == s - 1 ? 1 : 2);
  }
}
