#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e3 + 200;
const int inf = 0x3f3f3f3f;
const double eps = 1e-7;
const double pi = acos(-1.0);
const int mod = 1e9 + 7;
inline int lowbit(int x) { return x & (-x); }
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
void ex_gcd(long long a, long long b, long long &d, long long &x,
            long long &y) {
  if (!b) {
    d = a, x = 1, y = 0;
  } else {
    ex_gcd(b, a % b, d, y, x);
    y -= x * (a / b);
  }
}
inline long long qpow(long long a, long long b, long long MOD = mod) {
  long long res = 1;
  a %= MOD;
  while (b > 0) {
    if (b & 1) res = res * a % MOD;
    a = a * a % MOD;
    b >>= 1;
  }
  return res;
}
inline long long inv(long long x, long long p) { return qpow(x, p - 2, p); }
inline long long Jos(long long n, long long k, long long s = 1) {
  long long res = 0;
  for (int i = 1; i <= n + 1; ++i) res = (res + k) % i;
  return (res + s) % n;
}
inline long long read() {
  long long f = 1;
  long long x = 0;
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
    x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
  return x * f;
}
int dir[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
long long n;
long long l[maxn], r[maxn];
long long Map[maxn];
long long a[maxn];
int main() {
  n = read();
  for (int i = 1; i <= n; ++i) l[i] = read();
  for (int i = 1; i <= n; ++i) r[i] = read();
  long long ma = 0;
  int flag = 1;
  for (int i = 1; i <= n; ++i) {
    Map[l[i] + r[i] + 1]++,
        ma = ((ma) > (l[i] + r[i] + 1) ? (ma) : (l[i] + r[i] + 1));
    if (l[i] == n || r[i] == n || l[i] >= i || r[i] > n - i) flag = 0;
  }
  if (ma > n) flag = 0;
  for (int i = 1; i <= ma; ++i) {
    if (!Map[i]) {
      long long cnt = 0;
      for (int j = 1; j <= i - 1; ++j) cnt += Map[j];
      if (cnt < i || i > n) {
        flag = 0;
        break;
      }
    }
  }
  if (!flag)
    cout << "NO" << '\n';
  else {
    long long up = n;
    for (int i = 1; i <= n; ++i) a[i] = up - (l[i] + r[i]);
    for (int i = 1; i <= n; ++i) {
      long long cnt1 = 0;
      long long cnt2 = 0;
      for (int j = 1; j <= i - 1; ++j) cnt1 += (a[j] > a[i]);
      for (int j = i + 1; j <= n; ++j) cnt2 += (a[j] > a[i]);
      if (cnt1 != l[i] || cnt2 != r[i]) {
        flag = 0;
        break;
      }
    }
    if (!flag)
      cout << "NO" << '\n';
    else {
      cout << "YES" << '\n';
      for (int i = 1; i <= n; ++i) cout << a[i] << ' ';
      cout << '\n';
    }
  }
  return 0;
}
