#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long N = 1005;
long long n, l[N], r[N], ans[N], flag = 0;
set<pair<long long, long long>> s;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n;
  for (long long i = 1; i <= n; i++) cin >> l[i];
  for (long long i = 1; i <= n; i++) cin >> r[i];
  for (long long i = 1; i <= n; i++) s.insert({l[i] + r[i], i});
  for (long long i = 0; i <= n; i++) ans[i] = 1;
  for (long long i = 1; i <= n; i++) {
    long long cnt = l[i];
    for (auto it : s) {
      if (cnt) {
        if (it.second < i) {
          ans[it.second]++;
          cnt--;
        }
      } else
        break;
    }
    cnt = r[i];
    for (auto it : s) {
      if (cnt) {
        if (it.second > i) {
          ans[it.second]++;
          cnt--;
        }
      } else
        break;
    }
  }
  for (long long i = 1; i <= n; i++) {
    long long left = 0, right = 0;
    for (long long j = 1; j < i; j++)
      if (ans[j] > ans[i]) left++;
    if (l[i] != left) {
      flag = 1;
      break;
    }
    for (long long j = i + 1; j <= n; j++)
      if (ans[j] > ans[i]) right++;
    if (r[i] != right) {
      flag = 1;
      break;
    }
  }
  for (long long i = 1; i <= n; i++)
    if (ans[i] > n) flag = 1;
  if (flag)
    cout << "NO" << endl;
  else {
    cout << "YES" << endl;
    for (long long i = 1; i <= n; i++) cout << ans[i] << " ";
  }
  return 0;
}
