#include <bits/stdc++.h>
using namespace std;
struct s {
  int ti, ti_1, ind;
};
int main() {
  int n;
  cin >> n;
  vector<int> a(n - 1);
  vector<int> b(n - 1);
  for (int i = 0; i < n - 1; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < n - 1; i++) {
    cin >> b[i];
  }
  vector<vector<s>> t(n - 1);
  for (int i = 0; i < n - 1; i++) {
    int a1 = a[i] >> 1, b1 = b[i] >> 1, a2 = a[i] & 1, b2 = b[i] & 1;
    if (a1 == 0 && b1 == 1 || a2 == 0 && b2 == 1) {
      cout << "NO";
      exit(0);
    }
    vector<s> cur;
    if (a1 == 0 && b1 == 0) {
      cur.push_back(s{0, 0, -1});
    } else if (a1 == 1 && b1 == 1) {
      cur.push_back(s{1, 1, -1});
    } else {
      cur.push_back(s{1, 0, -1});
      cur.push_back(s{0, 1, -1});
    }
    int cs = cur.size();
    for (int j = 0; j < cs; j++) {
      if (a2 == 0 && b2 == 0) {
        cur[j].ti = cur[j].ti << 1;
        cur[j].ti_1 = cur[j].ti_1 << 1;
      } else if (a2 == 1 && b2 == 1) {
        cur[j].ti = (cur[j].ti << 1) + 1;
        cur[j].ti_1 = (cur[j].ti_1 << 1) + 1;
      } else {
        int n = cur[j].ti, m = cur[j].ti_1;
        cur[j].ti = cur[j].ti << 1;
        cur[j].ti_1 = (cur[j].ti_1 << 1) + 1;
        cur.push_back(s{(n << 1) + 1, m << 1, -1});
      }
    }
    if (i == 0) {
      t[i] = cur;
    } else {
      for (int j = 0; j < t[i - 1].size(); j++) {
        for (int l = 0; l < cur.size(); l++) {
          if (t[i - 1][j].ti_1 == cur[l].ti) {
            cur[l].ind = j;
            t[i].push_back(cur[l]);
          }
        }
      }
    }
  }
  if (t[n - 2].size() == 0) {
    cout << "NO";
    exit(0);
  }
  vector<int> ans;
  ans.push_back(t[n - 2][0].ti_1);
  int ind = 0;
  for (int i = n - 2; i >= 0; i--) {
    ans.push_back(t[i][ind].ti);
    ind = t[i][ind].ind;
  }
  cout << "YES" << endl;
  for (int i = ans.size() - 1; i >= 0; i--) {
    cout << ans[i] << " ";
  }
}
