#include <bits/stdc++.h>
using namespace std;
long long int n, l[1000005], r[1000005], ans[1000005], v[1000005], q, k, temp;
long long int f(long long int ind) {
  long long int x = l[ind];
  long long int y = r[ind];
  long long int lct = 0;
  long long int rct = lct;
  for (int i = ind; i <= n; i++) {
    if (ans[ind] < ans[i]) rct++;
  }
  for (int i = ind; i >= 1; i--) {
    if (ans[i] > ans[ind]) lct++;
  }
  if (lct == x && rct == y) return 1;
  return 0;
}
int main() {
  scanf("%lld", &n);
  for (int i = 1; i <= 2; i++) {
    for (int j = 1; j <= n; j++) {
      if (i == 1)
        scanf("%lld", &l[j]);
      else
        scanf("%lld", &r[j]);
    }
  }
  for (int i = 1; i <= n; i++) q = l[i] + r[i], ans[i] = n - q - i, ans[i] += i;
  for (int i = 1; i <= n; i++)
    if (f(i))
      continue;
    else {
      printf("NO");
      k = 1;
      return 0;
    }
  if (k == 0) {
    printf("YES\n");
    for (int i = 1; i <= n; i++) {
      printf("%lld ", ans[i]);
    }
  }
}
