#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const double pi = acos(-1.0), eps = 1e-9;
const int N = 3e5 + 111, inf = 1e9, mod = 1e9 + 7;
int n, a[N], l[N], r[N];
vector<int> v[N];
int main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> l[i];
  for (int i = 1; i <= n; ++i) cin >> r[i];
  for (int i = 1; i <= n; ++i) {
    if (l[i] + r[i] >= n) {
      cout << "NO";
      return 0;
    }
    v[l[i] + r[i]].push_back(i);
  }
  for (int i = 0; i < n; ++i)
    for (auto j : v[i]) a[j] = n - i;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      if (a[j] > a[i]) {
        if (j < i)
          l[i]--;
        else
          r[i]--;
      }
    }
    if (l[i] || r[i]) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES\n";
  for (int i = 1; i <= n; ++i) cout << a[i] << " ";
  return 0;
}
