#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<long long> L(n), R(n);
  for (int i = 0; i < n; ++i) cin >> L[i];
  for (int i = 0; i < n; ++i) cin >> R[i];
  vector<long long> ans(n, -1);
  int cnt = n;
  while (true) {
    bool flag = false;
    map<int, int> M;
    for (int i = 0; i < n; ++i) {
      if (L[i] == 0 && R[i] == 0) {
        ans[i] = cnt;
        flag = true;
        M[i] = 1;
      }
    }
    if (!flag) break;
    int k = 0;
    for (int i = 0; i < n; ++i) {
      if (M.find(i) != M.end())
        k++;
      else
        L[i] -= k;
    }
    k = 0;
    for (int i = n - 1; i >= 0; --i) {
      if (M.find(i) != M.end())
        k++;
      else
        R[i] -= k;
    }
    for (auto v : M) L[v.first] = R[v.first] = -1;
    cnt--;
  }
  for (int i = 0; i < n; ++i) {
    if (ans[i] <= 0) {
      cout << "NO\n";
      return 0;
    }
  }
  cout << "YES\n";
  for (int i = 0; i < n; ++i) cout << ans[i] << " ";
  cout << "\n";
  return 0;
}
