func_code_string: #include <bits/stdc++.h>   using namespace std;   const int N = 200200;   int n;   long long b[N], c[N];   long long a[N];   int dg[32];   void solve() {     memset((dg), (0), sizeof(dg));     long long sum = 0, suma = 0;     for (int i = (int)0; i < (int)n; ++i) sum += b[i] + c[i];     suma = sum / (n + n);     bool flag = 1;     for (int i = (int)0; i < (int)n; ++i) {       a[i] = (b[i] + c[i] - suma) / n;       if (a[i] < 0) flag = 0;     }     if (!flag) {       cout <<  -1 ;       return;     }     for (int i = (int)0; i < (int)n; ++i) {       int t = 0;       for (long long x = a[i]; x; x >>= 1) dg[t++] += (x & 1);     }     for (int i = (int)0; i < (int)n; ++i) {       long long x = a[i], sumi = 0;       for (int j = (int)0; j < (int)32; ++j)         if ((x >> j) & 1) sumi += (1 << j) * dg[j];       if (sumi != b[i]) {         flag = 0;         break;       }     }     if (!flag) {       cout <<  -1 ;       return;     }     for (int i = (int)0; i < (int)n; ++i) {       long long x = a[i], sumi = 0;       for (int j = (int)0; j < (int)32; ++j) {         if ((x >> j) & 1)           sumi += (1 << j) * n;         else           sumi += (1 << j) * dg[j];       }       if (sumi != c[i]) {         flag = 0;         break;       }     }     if (!flag) {       cout <<  -1 ;       return;     }     for (int i = (int)0; i < (int)n; ++i) cout << a[i] <<    ;   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(0);     cin >> n;     for (int i = (int)0; i < (int)n; ++i) cin >> b[i];     for (int i = (int)0; i < (int)n; ++i) cin >> c[i];     solve();     return 0;   }   