#include <bits/stdc++.h>
using namespace std;
const int N = (int)(1e6 + 5);
const int LOG = (int)(20);
int n, l[N], r[N], wr, dn, ar[N];
map<int, int> m;
set<int> s;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(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++) s.insert(l[i] + r[i]);
  for (auto it = s.rbegin(); it != s.rend(); it++) m[*it] = ++wr;
  for (int i = 1; i <= n; i++) ar[i] = m[l[i] + r[i]];
  for (int i = 1; i <= n; i++) {
    int more = 0;
    for (int j = i - 1; j >= 1; j--)
      if (ar[i] < ar[j]) more++;
    if (more != l[i]) {
      cout << "NO";
      return 0;
    }
    more = 0;
    for (int j = i + 1; j <= n; j++)
      if (ar[i] < ar[j]) more++;
    if (more != r[i]) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES"
       << "\n";
  for (int i = 1; i <= n; i++) cout << ar[i] << " ";
}
