#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, flg = -2, cnt1, cnt2, y, i, j, k;
  scanf("%d", &n);
  int ara[n + 4], tra[n + 4], art[n + 4];
  for (i = 0; i < n; i++) scanf("%d", &ara[i]);
  for (j = 0; j < n; j++) scanf("%d", &tra[j]);
  for (k = 0; k < n; k++) {
    if (k == 0 && ara[0] > 0) {
      flg = 1;
      break;
    } else if (k == n - 1 && tra[n - 1] > 0) {
      flg = 1;
      break;
    } else {
      if (ara[k] >= (k + 1) || tra[k] > n - (k + 1)) {
        flg = 1;
        break;
      } else {
        art[k] = ara[k] + tra[k] + 1;
      }
    }
  }
  if (flg == 1)
    printf("NO\n");
  else {
    for (i = 0; i < n; i++) art[i] = (n + 1) - art[i];
    for (i = 0; i < n; i++) {
      y = art[i];
      cnt1 = 0;
      cnt2 = 0;
      for (j = 0; j < i; j++) {
        if (art[j] > y) cnt1++;
      }
      for (j = i + 1; j < n; j++) {
        if (art[j] > y) cnt2++;
      }
      if (cnt1 != ara[i] || cnt2 != tra[i]) {
        flg = 1;
        break;
      }
    }
    if (flg == 1)
      printf("NO\n");
    else {
      printf("YES\n");
      for (i = 0; i < n; i++) printf("%d ", art[i]);
    }
  }
  return 0;
}
