#include <bits/stdc++.h>
using namespace std;
int l[1003], r[1003], ans[1003], l2[1003], r2[1003];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &l[i]);
  for (int i = 0; i < n; i++) scanf("%d", &r[i]);
  for (int i = 0; i < n; i++) ans[i] = n;
  for (int i = 0; i < n; i++) ans[i] -= l[i];
  for (int i = 0; i < n; i++) ans[i] -= r[i];
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < i; j++) {
      if (ans[j] > ans[i]) {
        l2[i]++;
      }
    }
    for (int j = n - 1; j > i; j--) {
      if (ans[j] > ans[i]) {
        r2[i]++;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    if (l2[i] != l[i] || r2[i] != r[i]) {
      printf("NO\n");
      return 0;
    }
  }
  printf("YES\n");
  for (int i = 0; i < n; i++) {
    printf("%d", ans[i]);
    if (i < n - 1) printf(" ");
  }
  return 0;
}
