#include <cstdio>
#include <iostream>
using namespace std;
#define maxn 100005
inline void read(int& x)
{	char c=getchar();x=0;int y=1;
	while(c<'0'||c>'9'){if(c=='-') y=-1;c=getchar();}
	while(c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
	x*=y;
}
typedef long long ll;
const ll mod=1e9+7;
int n,A[maxn],B[maxn];
ll suma[maxn][2],sumb[maxn][2];
int solve()
{	freopen("xorarray.in","r",stdin);
	freopen("xorarray.out","w",stdout);
	read(n);
	for(int i=1;i<=n;++i) read(A[i]);
	for(int i=1;i<=n;++i) read(B[i]);
	for(int i=1;i<=n;++i)
	{	ll x=0;
		for(int j=0;j<=30;++j)
		{	++suma[j][(A[i]>>j)&1];++sumb[j][(B[i]>>j)&1];
			ll tmp=((ll)suma[j][0]*sumb[j][1]+(ll)suma[j][1]*sumb[j][0])%mod;
			x=(x+tmp*(1<<j)%mod)%mod;
		}
		printf("%lld ",x);
	}
}
int Anonymity=solve();
int main(){;}