func_code_string: #include <bits/stdc++.h>   using namespace std;   const int maxn = 51000;   int a[1000000], b[1000000], t[1000000], n, flag = 0;   void dfs(int m) {     if (flag) return;     if (m == n) {       cout <<  YES  << endl;       for (int i = 1; i < n; i++) {         cout << t[i] <<    ;       }       cout << t[n] << endl;       flag = 1;       return;     }     for (int i = 0; i <= 3; i++) {       t[m + 1] = i;       if (a[m] == (t[m + 1] | t[m]) && b[m] == (t[m + 1] & t[m])) {         dfs(m + 1);       }     }   }   int main() {     cin >> n;     for (int i = 1; i < n; i++) {       cin >> a[i];     }     for (int i = 1; i < n; i++) {       cin >> b[i];     }     for (int i = 0; i <= 3; i++) {       t[1] = i;       dfs(1);       if (flag) break;     }     if (!flag) cout <<  NO  << endl;     return 0;   }   