#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1000000000 + 7;
const long long int MOD1 = 998244353;
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int strTo(string s) {
  stringstream tmp(s);
  long long int x = 0;
  tmp >> x;
  return x;
}
string NoTo(long long int n) {
  ostringstream str1;
  str1 << n;
  string ans = str1.str();
  return ans;
}
vector<bool> sieve(1000001, true);
void Sieve() {
  sieve[0] = false;
  sieve[1] = false;
  for (long long int i = 2; i * i <= 1000000; i++) {
    if (sieve[i] == true) {
      for (long long int j = i * i; j <= 1000000; j += i) sieve[j] = false;
    }
  }
}
long long int lcm(long long int a, long long int b) {
  return (a * b) / gcd(a, b);
}
long long int arrlcm(long long int arr[], long long int n) {
  long long int ans = arr[0];
  for (long long int i = 1; i < n; i++)
    ans = (((arr[i] * ans)) / (gcd(arr[i], ans)));
  return ans;
}
long long int arrgcd(long long int arr[], long long int n) {
  long long int result = arr[0];
  for (long long int i = 1; i < n; i++) {
    result = gcd(arr[i], result);
    if (result == 1) {
      return 1;
    }
  }
  return result;
}
long long int nCr(long long int n, long long int r) {
  long long int ans = 1;
  for (long long int i = (long long int)0; i < (long long int)r; i++) {
    ans = (ans * (n - i));
    ans = (ans / (i + 1));
  }
  return ans;
}
long long int fact(long long int n) {
  if (n == 0) return 1;
  return (n % MOD * fact(n - 1) % MOD) % MOD;
}
vector<long long int> v;
void Divisors(long long int n) {
  for (long long int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (n / i == i)
        v.push_back(i);
      else {
        v.push_back(i);
        v.push_back(n / i);
      }
    }
  }
}
long long int no_of_divisors(long long int n) {
  long long int c = 0;
  for (long long int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (n / i == i)
        c = c + 1;
      else
        c = c + 2;
    }
  }
  return c;
}
long long int pwrn(long long int x, long long int y) {
  if (y == 0)
    return 1;
  else if (y % 2 == 0)
    return pwrn(x, y / 2) * pwrn(x, y / 2);
  else
    return x * pwrn(x, y / 2) * pwrn(x, y / 2);
}
long long int fun() { return 0; }
long long int pwr(long long int a, long long int b) {
  long long int res = 1;
  while (b > 0) {
    if (b & 1) res = res * a;
    a *= a;
    b >>= 1;
  }
  return res;
}
long long int pwrm(long long int a, long long int b, long long int m) {
  a %= m;
  long long int res = 1;
  while (b > 0) {
    if (b & 1) res = res * a % m;
    a = a * a % m;
    b >>= 1;
  }
  return res;
}
long long int digits(long long int n) {
  long long int x = floor(log10(n)) + 1;
  return x;
}
long long int level[100001];
bool vis[100001];
vector<pair<long long int, long long int> > dir = {
    {-1, 0}, {1, 0}, {0, -1}, {0, 1}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
vector<vector<long long int> > v1(100001);
void bfs(long long int s) {
  memset(vis, false, sizeof(vis));
  queue<long long int> q;
  q.push(s);
  vis[s] = true;
  level[s] = 0;
  while (!q.empty()) {
    long long int fr = q.front();
    q.pop();
    for (long long int i = (long long int)0; i < (long long int)v1[fr].size();
         i++) {
      if (!vis[v1[fr][i]]) {
        level[v1[fr][i]] = level[fr] + 1;
        q.push(v1[fr][i]);
        vis[v1[fr][i]] = true;
      }
    }
  }
}
long long int first(long long int arr[], long long int low, long long int high,
                    long long int x, long long int n) {
  if (high >= low) {
    long long int mid = low + (high - low) / 2;
    if ((mid == 0 || x > arr[mid - 1]) && arr[mid] == x)
      return mid;
    else if (x > arr[mid])
      return first(arr, (mid + 1), high, x, n);
    else
      return first(arr, low, (mid - 1), x, n);
  }
  return -1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long int n;
  cin >> n;
  long long int l[n];
  for (long long int i = (long long int)0; i < (long long int)n; i++)
    cin >> l[i];
  long long int r[n];
  for (long long int i = (long long int)0; i < (long long int)n; i++)
    cin >> r[i];
  long long int ans[n];
  long long int ctr = 0;
  for (long long int i = (long long int)0; i < (long long int)n; i++) {
    long long int sum = l[i] + r[i];
    ans[i] = n - sum;
  }
  for (long long int i = (long long int)0; i < (long long int)n; i++) {
    long long int lf = 0, rt = 0;
    for (long long int j = (long long int)0; j < (long long int)i; j++) {
      if (ans[j] > ans[i]) lf++;
    }
    for (long long int j = (long long int)i + 1; j < (long long int)n; j++) {
      if (ans[j] > ans[i]) rt++;
    }
    if (lf != l[i] || rt != r[i]) ctr++;
  }
  if (ctr > 0)
    cout << "NO\n";
  else {
    cout << "YES\n";
    for (long long int i = (long long int)0; i < (long long int)n; i++)
      cout << ans[i] << " ";
    cout << "\n";
  }
  cerr << "Time Elapsed : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC
       << "ms\n";
  return 0;
}
