#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  bool cant = false;
  cin >> n;
  int l[n], r[n], res[n], mx = 0;
  vector<pair<int, int> > sum(n);
  for (int i = 0; i < n; i++) {
    cin >> l[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> r[i];
    if (l[i] + r[i] >= n) cant = true;
    res[i] = n - l[i] - r[i];
  }
  if (cant) {
    cout << "NO" << endl;
    return 0;
  }
  int left, right;
  for (int i = 0; i < n; i++) {
    right = left = 0;
    for (int j = 0; j < i; j++) {
      if (res[j] > res[i]) left++;
    }
    for (int j = i + 1; j < n; j++) {
      if (res[j] > res[i]) right++;
    }
    if (right != r[i] || left != l[i]) {
      cout << "NO" << endl;
      return 0;
    }
  }
  cout << "YES" << endl;
  for (int i = 0; i < n; i++) {
    cout << res[i];
    if (i != n - 1) cout << " ";
  }
  cout << endl;
  return 0;
}
