#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const int N = 1e5 + 5;
inline long long pow_mod(long long x, long long n) {
  long long r = 1;
  while (n) {
    if (n & 1) r = (r * x) % MOD;
    x = (x * x) % MOD;
    n >>= 1;
  }
  return r;
}
inline long long pow_(long long x, long long n) {
  long long r = 1;
  while (n) {
    if (n & 1) r = (r * x);
    x = (x * x);
    n >>= 1;
  }
  return r;
}
inline void solve() {
  int n;
  cin >> n;
  int l[n];
  for (int i = 0; i < n; i++) cin >> l[i];
  int r[n];
  for (int i = 0; i < n; i++) cin >> r[i];
  int ans[n];
  for (int i = 0; i < n; i++) ans[i] = n - (l[i] + r[i]);
  for (int i = 0; i < n; i++) {
    for (int j = i - 1; j >= 0; j--)
      if (ans[i] < ans[j]) l[i]--;
    if (l[i]) {
      cout << "NO\n";
      return;
    }
    for (int j = i + 1; j < n; j++)
      if (ans[i] < ans[j]) r[i]--;
    if (r[i]) {
      cout << "NO\n";
      return;
    }
  }
  cout << "YES\n";
  for (int &x : ans) cout << x << ' ';
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t = 1;
  while (t--) solve();
}
