#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n;
int l[N], r[N];
int lvl[N];
int c;
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]);
  }
  for (int i = 1; i <= n; i++) {
    if (l[i] >= i || r[i] > n - i) return cout << "NO", 0;
    lvl[i] = n - l[i] - r[i];
  }
  for (int i = 1; i <= n; i++) {
    c = 0;
    for (int j = i + 1; j <= n; j++) {
      if (lvl[j] > lvl[i]) c++;
    }
    if (c != r[i]) return cout << "NO", 0;
    c = 0;
    for (int j = 1; j < i; j++) {
      if (lvl[j] > lvl[i]) c++;
    }
    if (c != l[i]) return cout << "NO", 0;
  }
  cout << "YES" << '\n';
  for (int i = 1; i <= n; i++) {
    cout << lvl[i] << ' ';
  }
  return 0;
}
