#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  int l[n], r[n];
  for (int i = 0; i < n; i++) cin >> l[i];
  for (int i = 0; i < n; i++) cin >> r[i];
  vector<int> ans(n, 0);
  int pos = -1;
  for (int i = 0; i < n; i++) {
    if (i == 0 && l[i] > 0) {
      cout << "NO";
      return 0;
    }
    if (i == n - 1 && r[i] > 0) {
      cout << "NO";
      return 0;
    }
    if (l[i] == 0 && r[i] == 0) {
      pos = i;
      ans[i] = n;
      break;
    }
  }
  if (pos == -1) {
    cout << "NO";
    return 0;
  }
  for (int i = pos - 1; i >= 0; i--) {
    if (r[i] < 1 && l[i] != 0) {
      cout << "NO";
      return 0;
    }
    ans[i] = ans[pos] - r[i] - l[i];
  }
  for (int i = pos + 1; i < n; i++) {
    if (l[i] < 1 && r[i] != 0) {
      cout << "NO";
      return 0;
    }
    ans[i] = ans[pos] - l[i] - r[i];
  }
  for (int i = 0; i < n; i++) {
    int cntr = 0;
    for (int j = i + 1; j < n; j++) {
      if (ans[j] > ans[i]) cntr++;
    }
    int cntl = 0;
    for (int j = i - 1; j >= 0; j--) {
      if (ans[j] > ans[i]) cntl++;
    }
    if (cntr != r[i] || cntl != l[i]) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES" << endl;
  for (int i = 0; i < n; i++) cout << ans[i] << " ";
  return 0;
}
