#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
string print_iterable(T1 begin_iter, T2 end_iter, int counter) {
  bool done_something = false;
  stringstream res;
  res << "[";
  for (; begin_iter != end_iter and counter; ++begin_iter) {
    done_something = true;
    counter--;
    res << *begin_iter << ", ";
  }
  string str = res.str();
  if (done_something) {
    str.pop_back();
    str.pop_back();
  }
  str += "]";
  return str;
}
vector<int> SortIndex(int size, std::function<bool(int, int)> compare) {
  vector<int> ord(size);
  for (int i = 0; i < size; i++) ord[i] = i;
  sort(ord.begin(), ord.end(), compare);
  return ord;
}
template <typename T>
bool MinPlace(T& a, const T& b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
bool MaxPlace(T& a, const T& b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename Container>
int SZ(const Container& S) {
  return S.size();
}
template <typename S, typename T>
ostream& operator<<(ostream& out, const pair<S, T>& p) {
  out << "{" << p.first << ", " << p.second << "}";
  return out;
}
template <typename T>
ostream& operator<<(ostream& out, const vector<T>& v) {
  out << "[";
  for (int i = 0; i < (int)v.size(); i++) {
    out << v[i];
    if (i != (int)v.size() - 1) out << ", ";
  }
  out << "]";
  return out;
}
const int MAXN = -1;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int N;
  cin >> N;
  vector<int> L(N);
  vector<int> R(N);
  vector<int> ans(N);
  vector<int> removed(N, 0);
  for (int i = 0; i < N; i++) cin >> L[i];
  for (int i = 0; i < N; i++) cin >> R[i];
  int count = 0;
  while (count != N) {
    int found = 0;
    for (int i = 0; i < N; i++) {
      if (L[i] == 0 and R[i] == 0 and !removed[i]) {
        found++;
        removed[i] = 2;
        ans[i] = N - count;
      }
    }
    if (found == 0) {
      cout << "NO\n";
      return 0;
    }
    int curr = 0;
    for (int i = 0; i < N; i++) {
      if (removed[i] == 2) {
        removed[i] = 1;
        curr++;
      } else if (!removed[i]) {
        L[i] -= curr;
        R[i] -= found - curr;
      }
    }
    count += found;
  }
  cout << "YES\n";
  for (int i = 0; i < N; i++) cout << ans[i] << " ";
  cout << "\n";
}
