#include <bits/stdc++.h>
using namespace std;
long long int l[1007], r[1007], a[1007];
vector<pair<long long int, long long int> > vs;
bool cmp(pair<long long int, long long int> a,
         pair<long long int, long long int> b) {
  return a.second > b.second;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, m, i, j, u, v, num = 1;
  long long int ansx = 1;
  cin >> n;
  for (i = 1; i <= n; i++) cin >> l[i];
  for (i = 1; i <= n; i++) cin >> r[i];
  for (i = 1; i <= n; i++) vs.push_back({i, l[i] + r[i]});
  sort(vs.begin(), vs.end(), cmp);
  for (i = 0; i < vs.size(); i++) {
    a[vs[i].first] = num;
    if (i + 1 < vs.size()) {
      if (vs[i + 1].second < vs[i].second) num++;
    }
  }
  for (i = 1; i <= n; i++) {
    u = 0, v = 0;
    for (j = i - 1; j >= 1; j--)
      if (a[j] > a[i]) u++;
    for (j = i + 1; j <= n; j++)
      if (a[j] > a[i]) v++;
    if (u != l[i] || v != r[i]) ansx = 0;
  }
  if (!ansx)
    cout << "NO" << '\n';
  else {
    cout << "YES" << '\n';
    for (i = 1; i <= n; i++) cout << a[i] << " ";
    cout << '\n';
  }
  return 0;
}
