func_code_string: #include <bits/stdc++.h>   using namespace std;   const int mx = 2e5 + 10;   const int mxb = 60;   long long int a[mx], b[mx], c[mx];   int cnt[mxb][2];   int bat(int idx, long long int v) {     if (v & (1ll << idx)) return 1;     return 0;   }   int main() {     int n;     scanf( %d , &n);     long long int sm = 0;     for (int i = 0; i < n; i++) scanf( %lld , b + i);     for (int i = 0; i < n; i++) scanf( %lld , c + i), sm += b[i] + c[i];     sm /= n + n;     for (int i = 0; i < n; i++) {       a[i] = (b[i] + c[i] - sm) / n;       if (a[i] < 0) {         puts( -1 );         return 0;       }       for (int j = 0; j < mxb; j++) cnt[j][bat(j, a[i])]++;     }     for (int i = 0; i < n; i++) {       long long int bi = 0, ci = 0;       int cb = 0, cc = 0;       for (int j = 0; j < mxb; j++) {         int db = cb, dc = cc;         for (int x = 0; x < 2; x++) {           db += cnt[j][x] * (bat(j, a[i]) & x);           dc += cnt[j][x] * (bat(j, a[i]) | x);         }         cb = db / 2, cc = dc / 2;         if (db & 1) bi |= (1ll << j);         if (dc & 1) ci |= (1ll << j);       }       if (bi != b[i] || ci != c[i]) {         puts( -1 );         return 0;       }     }     for (int i = 0; i < n; i++) printf( %lld  , a[i]);     puts(  );     return 0;   }   