#include <bits/stdc++.h>
using namespace std;
struct student {
  int l, r, ix, s, c;
};
int main() {
  int n;
  cin >> n;
  vector<student> xs(n);
  for (int i = 0; i < n; i++) {
    cin >> xs[i].l;
    xs[i].ix = i;
  }
  for (int i = 0; i < n; i++) {
    cin >> xs[i].r;
    xs[i].s = xs[i].l + xs[i].r;
  }
  auto comp = [](student a, student b) { return a.s > b.s; };
  sort(xs.begin(), xs.end(), comp);
  int cz = 0;
  int ms = 10000;
  for (int i = 0; i < n; i++) {
    auto &x = xs[i];
    if (x.s < ms) {
      cz += 1;
      ms = x.s;
    }
    x.c = cz;
  }
  auto comp2 = [](student a, student b) { return a.ix < b.ix; };
  sort(xs.begin(), xs.end(), comp2);
  for (int i = 0; i < n; i++) {
    int cl = 0;
    for (int j = 0; j < i; j++) {
      if (xs[i].c < xs[j].c) cl += 1;
    }
    int cr = 0;
    for (int j = i + 1; j < n; j++) {
      if (xs[i].c < xs[j].c) cr += 1;
    }
    if (cl != xs[i].l || cr != xs[i].r) {
      cout << "NO" << endl;
      return 0;
    }
  }
  cout << "YES" << endl;
  for (int i = 0; i < n; i++) {
    cout << xs[i].c << " ";
  }
  cout << endl;
  return 0;
}
