#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n;
  cin >> n;
  vector<long long int> arr1(n), arr2(n);
  for (int i = 0; i < n; i++) cin >> arr1[i];
  for (int i = 0; i < n; i++) cin >> arr2[i];
  if (arr1[0] != 0 || arr2[n - 1] != 0) {
    cout << "NO";
    return 0;
  }
  vector<long long int> ans(n);
  for (int i = 0; i < n; i++) ans[i] = n - (arr1[i] + arr2[i]);
  long long int mn = *min_element(ans.begin(), ans.end());
  if (mn <= 0) {
    cout << "NO";
    return 0;
  }
  mn--;
  for (int i = 0; i < n; i++) ans[i] -= mn;
  long long int mx = *max_element(ans.begin(), ans.end());
  if (mx > n) {
    cout << "NO";
    return 0;
  }
  for (int i = 1; i < n; i++) {
    long long int cnt = 0;
    for (int j = 0; j < i; j++)
      if (ans[j] > ans[i]) cnt++;
    if (cnt != arr1[i]) {
      cout << "NO";
      return 0;
    }
  }
  for (int i = n - 2; i >= 0; i--) {
    long long int cnt = 0;
    for (int j = n - 1; j > i; j--)
      if (ans[j] > ans[i]) cnt++;
    if (cnt != arr2[i]) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES" << endl;
  for (int i = 0; i < n; i++) cout << ans[i] << " ";
  return 0;
}
