Problem: Euler is a little, cute squirrel. When the autumn comes, he collects some reserves for winter. The interesting fact is that Euler likes to collect acorns in a specific way. A tree can be described as n acorns connected by n - 1 branches, such that there is exactly one way between each pair of acorns. Let's enumerate the acorns from 1 to n.

The squirrel chooses one acorn (not necessary with number 1) as a start, and visits them in a way called "Euler tour" (see notes), collecting each acorn when he visits it for the last time.

Today morning Kate was observing Euler. She took a sheet of paper and wrote down consecutive indices of acorns on his path. Unfortunately, during her way to home it started raining and some of numbers became illegible. Now the girl is very sad, because she has to present the observations to her teacher.

"Maybe if I guess the lacking numbers, I'll be able to do it!" she thought. Help her and restore any valid Euler tour of some tree or tell that she must have made a mistake.

Input

The first line contains a single integer n (1 ≤ n ≤ 5 ⋅ 10^5), denoting the number of acorns in the tree.

The second line contains 2n - 1 integers a_1, a_2, …, a_{2n-1} (0 ≤ a_i ≤ n) — the Euler tour of the tree that Kate wrote down. 0 means an illegible number, which has to be guessed.

Output

If there is no Euler tour satisfying the given description, output "no" in the first line.

Otherwise, on the first line output "yes", and then in the second line print the Euler tour which satisfy the given description.

Any valid Euler tour will be accepted, since the teacher doesn't know how exactly the initial tree looks.

Examples

Input

2
1 0 0


Output

yes
1 2 1


Input

4
1 0 3 2 0 0 0


Output

yes
1 4 3 2 3 4 1


Input

5
0 1 2 3 4 1 0 0 0


Output

no

Note

An Euler tour of a tree with n acorns is a sequence of 2n - 1 indices of acorns. such that each acorn occurs at least once, the first and the last acorns are same and each two consecutive acorns are directly connected with a branch.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000 + 7;
const long long LL_INF = 1ll * INF * INF;
const int MAX_N = 500000 + 7;
template <typename T>
inline void addmod(T& a, const long long& b, const int& MOD = INF) {
  a = (a + b) % MOD;
  if (a < 0) a += MOD;
}
int cnt[MAX_N];
vector<int> a;
int nxt_ptr[MAX_N * 2];
int prev_ptr[MAX_N * 2];
int n;
vector<int> un_used;
int first_index[MAX_N], last_index[MAX_N];
void update(int pos, int value) {
  a[pos] = value;
  first_index[value] = min(first_index[value], pos);
  last_index[value] = max(last_index[value], pos);
}
bool inside(int value, int lhs, int rhs) {
  return first_index[value] >= lhs && last_index[value] <= rhs;
}
bool fill_range(int u, int v) {
  int last = -1;
  for (int i = nxt_ptr[u]; i < v; i = nxt_ptr[i])
    if (!a[i]) {
      if (last == -1) {
        if (un_used.empty()) {
          return false;
        }
        last = un_used.back();
        un_used.pop_back();
      }
      update(i, last);
    }
  return true;
}
void merge_node(int u, int v) {
  if (prev_ptr[u] != -1) {
    nxt_ptr[prev_ptr[u]] = v;
  }
  prev_ptr[v] = prev_ptr[u];
}
bool recover(int u, int v) {
  if ((v - u) & 1) return false;
  for (int i = nxt_ptr[u]; i < v; i = nxt_ptr[i])
    if (a[i] != 0 && !inside(a[i], u, v)) return false;
  vector<pair<bool, int>> stack_;
  for (int i = u; i <= v; i = nxt_ptr[i]) {
    stack_.push_back({a[i] > 0, i});
    while (stack_.size() >= 3) {
      int sz = (int)(stack_).size();
      if ((stack_[sz - 1].first ^ stack_[sz - 3].first) &&
          stack_[sz - 2].first) {
        int arr_[3];
        for (int j = (0), _b = (3); j < _b; ++j) {
          arr_[j] = stack_.back().second;
          stack_.pop_back();
        }
        int mx = max(a[arr_[0]], a[arr_[2]]);
        a[arr_[0]] = a[arr_[2]] = mx;
        merge_node(arr_[2], arr_[0]);
        stack_.push_back({true, arr_[0]});
      } else
        break;
    }
  }
  while (stack_.size() >= 3) {
    int sz = (int)(stack_).size();
    if (stack_[sz - 1].first && stack_[sz - 2].first && stack_[sz - 3].first) {
      if (a[stack_[sz - 1].second] != a[u]) return false;
    }
    stack_.pop_back();
  }
  int last = u;
  for (int i = u, j = 0; i <= v; i = nxt_ptr[i], ++j)
    if ((i - last) % 2 == 0) {
      if (i != last && (a[i] == a[u] || a[i] == 0)) {
        update(i, a[u]);
        bool check = fill_range(last, i);
        if (!check) return false;
        last = i;
      }
    }
  merge_node(u, v);
  return true;
}
int last_position[MAX_N];
void solve() {
  cin >> n;
  int m_len = 2 * n - 1;
  a.resize(m_len);
  for (int i = 1; i <= n; ++i) {
    first_index[i] = m_len + 1;
    last_index[i] = -1;
    last_position[i] = -1;
  }
  for (int i = (0), _b = (m_len); i < _b; ++i) {
    nxt_ptr[i] = i + 1;
    prev_ptr[i] = i - 1;
    int u = 0;
    cin >> u;
    if (u) cnt[u]++;
    update(i, u);
  }
  for (int i = 1; i <= n; ++i)
    if (cnt[i] == 0) {
      un_used.push_back(i);
    }
  reverse(un_used.begin(), un_used.end());
  bool check = true;
  if (a[0] == 0 || a[m_len - 1] == 0) {
    if (a[0] == 0 && a[m_len - 1] == 0) {
      check = !un_used.empty();
      if (check) {
        a[m_len - 1] = a[0] = un_used.back();
        un_used.pop_back();
      }
    } else {
      int mx = max(a[0], a[m_len - 1]);
      update(0, mx);
      update(m_len - 1, mx);
    }
  } else {
    check &= a[0] == a[m_len - 1];
  }
  for (int i = 0; i < m_len && check; ++i) {
    int u = a[i];
    if (!u) continue;
    if (last_position[u] != -1) {
      int prev_i = last_position[u];
      check &= recover(prev_i, i);
    }
    last_position[u] = i;
  }
  if (check) {
    cout << "yes\n";
    for (int i = 0; i < m_len; ++i) {
      cout << a[i] << " \n"[i + 1 == m_len];
    }
  } else {
    cout << "no\n";
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  const bool multiple_test = false;
  int test = 1;
  if (multiple_test) cin >> test;
  for (int i = 0; i < test; ++i) {
    solve();
  }
}