#include <bits/stdc++.h>
using namespace std;
int n;
int l[1005];
int r[1005];
int ans[1005];
bool f[1005];
int mx[1005];
int cnt, rem;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &l[i]);
  for (int i = 1; i <= n; i++) scanf("%d", &r[i]);
  rem = n;
  for (int t = 0; t < n; t++) {
    cnt = 0;
    for (int i = 1; i <= n; i++) {
      if (!f[i] && !l[i] && !r[i]) {
        mx[cnt++] = i;
        f[i] = 1;
      }
    }
    if (!cnt) {
      printf("NO");
      return 0;
    }
    for (int i = 0; i < cnt; i++) {
      ans[mx[i]] = n - t;
      for (int j = 1; j < mx[i]; j++) {
        if (f[j]) continue;
        r[j]--;
        if (r[j] < 0) {
          printf("NO");
          return 0;
        }
      }
      for (int j = mx[i] + 1; j <= n; j++) {
        if (f[j]) continue;
        l[j]--;
        if (l[j] < 0) {
          printf("NO");
          return 0;
        }
      }
    }
    rem -= cnt;
    if (!rem) break;
  }
  puts("YES");
  for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
  return 0;
}
