#include <bits/stdc++.h>
using namespace std;
const long long int INF = 2000000000000000000;
long long int MOD(long long int a, long long int b) {
  if (a > b)
    return a - b;
  else
    return b - a;
}
long long int max3(long long int a, long long int b, long long int c) {
  return max(c, max(a, b));
}
long long int min3(long long int a, long long int b, long long int c) {
  return min(a, min(b, c));
}
long long int power(long long int x, long long int y) {
  long long int res = 1;
  while (y > 0) {
    if (y & 1) res = (res * x);
    y = y >> 1;
    x = (x * x);
  }
  return res;
}
long long int logg(long long int a) {
  long long int x = 0;
  while (a > 1) {
    x++;
    a /= 2;
  }
  return x;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int abso(int x) {
  if (x < 0) {
    return -x;
  }
  return x;
}
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<int> b(n);
  for (int i = 0; i < n; i++) {
    cin >> b[i];
  }
  int sum = 0;
  vector<int> ans(n);
  int j = n;
  int num = 0;
  int k = 0;
  while (k < n) {
    num = 0;
    for (int i = 0; i < n; i++) {
      if ((a[i] + b[i]) == sum) {
        ans[i] = j;
        num++;
        k++;
      }
    }
    if (num == 0) {
      cout << "NO";
      return 0;
    }
    sum = sum + num;
    j--;
  }
  for (int i = 0; i < n; i++) {
    int l = 0;
    int r = 0;
    for (int j = 0; j < i; j++) {
      if (ans[j] > ans[i]) {
        l++;
      }
    }
    for (int j = i + 1; j < n; j++) {
      if (ans[j] > ans[i]) {
        r++;
      }
    }
    if (l != a[i] || r != b[i]) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES" << endl;
  for (int i = 0; i < ans.size(); i++) {
    cout << ans[i] << ' ';
  }
}
