#include <bits/stdc++.h>
using namespace std;
int l[1010], r[1010], ans[1010];
vector<int> b[2010];
int main() {
  int n;
  while (cin >> n) {
    for (int i = 0; i < n; ++i) {
      cin >> l[i];
    }
    for (int i = 0; i < n; ++i) {
      cin >> r[i];
      b[l[i] + r[i]].push_back(i);
    }
    memset(ans, -1, sizeof ans);
    int cnt = n, cnt1, cnt2, tmp;
    vector<int> v;
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < b[i].size(); ++j) {
        tmp = b[i][j];
        cnt1 = 0;
        cnt2 = 0;
        for (int k = 0; k < tmp; ++k) {
          if (ans[k] > 0) ++cnt1;
        }
        for (int k = tmp + 1; k < n; ++k) {
          if (ans[k] > 0) ++cnt2;
        }
        if (cnt1 == l[tmp] && cnt2 == r[tmp]) {
          v.push_back(tmp);
        }
      }
      for (int j = 0; j < v.size(); ++j) ans[v[j]] = cnt;
      v.clear();
      --cnt;
    }
    bool f = 1;
    for (int i = 0; i < n; ++i) {
      if (ans[i] == -1) {
        f = 0;
        break;
      }
    }
    if (!f) {
      cout << "NO" << endl;
    } else {
      cout << "YES" << endl;
      for (int i = 0; i < n; ++i) {
        cout << ans[i] << " ";
      }
      cout << endl;
    }
  }
  return 0;
}
