#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
using namespace std;
bool is_prime(long long n) {
  if (n <= 1) {
    return false;
  }
  for (long long i = 2; i * i <= n; ++i) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
inline long long getPow(long long a, long long b) {
  long long res = 1ll, tp = a;
  while (b) {
    if (b & 1ll) {
      res *= tp;
    }
    tp *= tp;
    b >>= 1ll;
  }
  return res;
}
long long coso(long long x1, long long y1, long long x2, long long y2,
               long long x3, long long y3) {
  return abs((x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1));
}
inline long long nxt() {
  long long x;
  cin >> x;
  return x;
}
void ok() {
  puts("YES");
  exit(0);
}
void no() {
  puts("NO");
  exit(0);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n = nxt();
  vector<pair<long long, long long> > mas(n);
  for (int i = 0; i < n; i++) {
    mas[i].first = nxt();
  }
  for (int i = 0; i < n; i++) {
    mas[i].second = nxt();
  }
  vector<long long> ans(n);
  for (int i = 0; i < n; i++) {
    ans[i] = n - mas[i].second - mas[i].first;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < i; j++) {
      if (ans[j] > ans[i]) {
        mas[i].first--;
      }
    }
    for (int j = i + 1; j < n; j++) {
      if (ans[j] > ans[i]) {
        mas[i].second--;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    if (mas[i].first != 0 || mas[i].second != 0) no();
  }
  cout << "YES\n";
  for (auto x : ans) {
    cout << x << " ";
  }
  return 0;
}
