#include <bits/stdc++.h>
using namespace std;
static inline void canhazfast() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
}
template <typename T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <typename T>
T extgcd(T a, T b, T &x, T &y) {
  T x0 = 1, y0 = 0, x1 = 0, y1 = 1;
  while (b) {
    T q = a / b;
    a %= b;
    swap(a, b);
    x0 -= q * x1;
    swap(x0, x1);
    y0 -= q * y1;
    swap(y0, y1);
  }
  x = x0;
  y = y0;
  return a;
}
static inline int ctz(unsigned x) { return __builtin_ctz(x); }
static inline int ctzll(unsigned long long x) { return __builtin_ctzll(x); }
static inline int clz(unsigned x) { return __builtin_clz(x); }
static inline int clzll(unsigned long long x) { return __builtin_clzll(x); }
static inline int popcnt(unsigned x) { return __builtin_popcount(x); }
static inline int popcntll(unsigned long long x) {
  return __builtin_popcountll(x);
}
static inline int bsr(unsigned x) { return 31 ^ clz(x); }
static inline int bsrll(unsigned long long x) { return 63 ^ clzll(x); }
int main() {
  canhazfast();
  static int l[1024], r[1024], a[1024];
  static pair<int, int> p[1024];
  int n;
  int val, last = 0, cnt = 0, tot = 0;
  cin >> n;
  val = n;
  for (int i = 0; i < n; ++i) cin >> l[i];
  for (int i = 0; i < n; ++i) {
    cin >> r[i];
    if (l[i] > i || r[i] >= n - i || l[i] + r[i] >= n) return cout << "NO", 0;
    p[i] = make_pair(l[i] + r[i], i);
  }
  if (n == 1) return cout << "YES\n1", 0;
  sort(p, p + n);
  if (p[0].first) return cout << "NO", 0;
  for (int i = 0; i < n; ++i) {
    if (p[i].first != last) {
      tot += cnt;
      cnt = 0;
      --val;
      last = p[i].first;
    }
    if (tot != p[i].first) return cout << "NO", 0;
    a[p[i].second] = val;
    ++cnt;
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < i; ++j)
      if (a[j] > a[i]) --l[i];
    for (int j = i + 1; j < n; ++j)
      if (a[j] > a[i]) --r[i];
    if (l[i] || r[i]) return cout << "NO", 0;
  }
  cout << "YES\n";
  for (int i = 0; i < n; ++i) cout << a[i] << ' ';
  return 0;
}
