#include <bits/stdc++.h>
using namespace std;
long long a[100009];
map<int, int> m;
int l[1005];
int r[1006];
int p[1007];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> l[i];
  }
  int x = 0;
  for (int i = 0; i < n; i++) {
    cin >> r[i];
    x = l[i] + r[i];
    p[i] = n - x;
  }
  int w = 0;
  int s = 0;
  int u = 0;
  for (int i = 0; i < n; i++) {
    for (int j = i - 1; j >= 0; j--) {
      if (p[j] > p[i]) s++;
    }
    for (int j = i + 1; j < n; j++) {
      if (p[j] > p[i]) u++;
    }
    if (s == l[i] && u == r[i]) {
      s = 0;
      u = 0;
    } else {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES" << endl;
  for (int i = 0; i < n; i++) {
    cout << p[i] << " ";
  }
}
