#include <bits/stdc++.h>
using namespace std;
const int MX = 1e5 + 10, MD = 1e9 + 7;
long long n, m, ans[MX], tmp, l[MX], r[MX], p[MX], res[MX];
bool mark[MX];
pair<long long, long long> a[MX];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> l[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> r[i];
    a[i] = {l[i] + r[i], i};
  }
  sort(a, a + n);
  reverse(a, a + n);
  tmp = n;
  if (a[0].first >= n) return cout << "NO", 0;
  for (int i = n - 1; i >= 0; i--) {
    if (!mark[a[i].first]) {
      p[i] = tmp;
      mark[a[i].first] = 1;
      ans[a[i].first] = tmp;
      tmp--;
    } else {
      p[i] = ans[a[i].first];
    }
    res[a[i].second] = p[i];
  }
  for (int i = 0; i < n; i++) {
    if (res[i] < 1) return cout << "NO", 0;
    int flag = 0;
    m = 0;
    for (int j = i + 1; j < n; j++) {
      if (res[j] > res[i]) m++;
    }
    if (m != r[i]) flag = 1;
    m = 0;
    for (int j = i - 1; j >= 0; j--) {
      if (res[j] > res[i]) m++;
    }
    if (m != l[i]) flag = 1;
    if (flag) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES" << endl;
  for (int i = 0; i < n; i++) {
    cout << res[i] << " ";
  }
}
