#include <bits/stdc++.h>
const long long MOD = 1e9 + 7;
const long long MAXN = 1e6 + 1;
using namespace std;
long long readInt() {
  bool minus1 = false;
  long long result = 0;
  char ch;
  ch = getchar();
  while (true) {
    if (ch == '-') break;
    if (ch >= '0' && ch <= '9') break;
    ch = getchar();
  }
  if (ch == '-')
    minus1 = true;
  else
    result = ch - '0';
  while (true) {
    ch = getchar();
    if (ch < '0' || ch > '9') break;
    result = result * 10 + (ch - '0');
  }
  if (minus1)
    return -result;
  else
    return result;
}
int a[MAXN];
int b[MAXN];
int n;
int M[4][4];
vector<pair<int, int> > var[5][5];
pair<int, int> first(vector<pair<int, int> >& v, int x) {
  for (pair<int, int> C : v) {
    if (C.first == x) {
      return C;
    }
  }
  return {-1, -1};
}
void check(int x, int y) {
  vector<int> ans;
  ans.push_back(x);
  for (int i = 2; i < n; i++) {
    ans.push_back(y);
    pair<int, int> kek = first(var[a[i]][b[i]], y);
    if (kek.first != -1) {
      x = kek.first;
      y = kek.second;
    } else {
      return;
    }
  }
  ans.push_back(y);
  cout << "YES\n";
  for (int i : ans) {
    cout << i << ' ';
  }
  exit(0);
}
int main() {
  for (int i = 0; i <= 3; i++) {
    for (int j = 0; j <= 3; j++) {
      M[(i | j)][(i & j)] = 1;
    }
  }
  n = readInt();
  for (int i = 1; i < n; i++) {
    a[i] = readInt();
  }
  for (int i = 1; i < n; i++) {
    b[i] = readInt();
  }
  for (int i = 1; i < n; i++) {
    if (!M[a[i]][b[i]]) {
      cout << "NO";
      return 0;
    }
  }
  for (int i = 0; i <= 3; i++) {
    for (int j = 0; j <= 3; j++) {
      var[(i | j)][(i & j)].push_back({i, j});
    }
  }
  for (pair<int, int> C : var[a[1]][b[1]]) {
    check(C.first, C.second);
    check(C.second, C.first);
  }
  return 0;
}
