#include <bits/stdc++.h>
using namespace std;
int l[200000], r[200000], ans[200000];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> l[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> r[i];
  }
  set<int> s;
  for (int i = 0; i < n; i++) {
    s.insert(l[i] + r[i]);
  }
  int cnt = s.size();
  set<int>::iterator it;
  map<int, int> mp;
  for (it = s.begin(); it != s.end(); it++) {
    mp[*it] = cnt;
    cnt--;
  }
  for (int i = 0; i < n; i++) {
    ans[i] = mp[l[i] + r[i]];
  }
  for (int i = 0; i < n; i++) {
    int a = 0, b = 0;
    for (int j = 0; j < i; j++) {
      if (ans[j] > ans[i]) a++;
    }
    for (int j = i + 1; j < n; j++) {
      if (ans[j] > ans[i]) b++;
    }
    if (a != l[i] || b != r[i]) {
      cout << "NO" << endl;
      return 0;
    }
  }
  for (int i = 0; i < n; i++) {
    if (i == 0) cout << "YES" << endl;
    cout << ans[i] << " ";
  }
  cout << endl;
}
