#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<int> l(n);
  vector<int> r(n);
  vector<pair<int, int> > v(n);
  for (int i = 0; i < n; i++) {
    cin >> l[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> r[i];
  }
  for (int i = 0; i < n; i++) {
    v[i] = {l[i] + r[i], i};
  }
  sort(v.begin(), v.end());
  if (n == 1) {
    if (v[0].first == 0)
      cout << "YES" << endl << 1;
    else
      cout << "NO";
    return 0;
  }
  vector<int> t(n);
  for (int i = 0; i < n; i++) {
    if (i == 0) {
      t[v[i].second] = n;
    } else {
      if (v[i].first == v[i - 1].first) {
        t[v[i].second] = t[v[i - 1].second];
      } else {
        t[v[i].second] = t[v[i - 1].second] - 1;
        if (v[i].first != i) {
          cout << "NO";
          return 0;
        }
      }
    }
  }
  for (int i = 0; i < n; i++) {
    int gr = 0, sm = 0;
    for (int j = i + 1; j < n; j++) {
      if (t[j] > t[i]) gr++;
    }
    for (int j = 0; j < i; j++) {
      if (t[j] > t[i]) sm++;
    }
    if (sm != l[i] || gr != r[i]) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES" << endl;
  for (int i = 0; i < n; i++) {
    cout << t[i] << " ";
  }
}
