#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  long long a[n], b[n], c[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) cin >> b[i];
  pair<long long, long long> p[n];
  for (int i = 0; i < n; i++) p[i] = {a[i] + b[i], i};
  sort(p, p + n);
  for (int i = 0; i < n; i++) {
    if (i == 0)
      c[p[i].second] = n;
    else {
      if (p[i].first == p[i - 1].first)
        c[p[i].second] = c[p[i - 1].second];
      else
        c[p[i].second] = c[p[i - 1].second] - 1;
    }
  }
  for (int i = 0; i < n; i++) {
    int cnta = 0, cntb = 0;
    for (int j = max(i - 1, 0); j >= 0; j--)
      if (c[i] < c[j]) cnta++;
    for (int j = min(i + 1, n - 1); j < n; j++)
      if (c[i] < c[j]) cntb++;
    if (cnta != a[i] || cntb != b[i]) {
      cout << "NO" << endl;
      return 0;
    }
  }
  cout << "YES" << endl;
  for (int i = 0; i < n; i++) cout << c[i] << " ";
}
