#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10; 
int n,a[N],b[N],mk[N],ans;
void dfs(int x){
    if(x>n){
        cout<<ans;
    }
    for(int i=1;i<=n;i++){
        if(x==1)ans=(a[x]^b[i]);
        if(mk[i])continue;
        if(x!=1&&(b[i]^a[x])!=ans)continue;
        mk[i]=1;
//        cout<<x<<" "<<i<<" "<<ans<<endl;
        dfs(x+1);
        mk[i]=0;
    }
}
int main(){
    freopen("XORcipher.in","r",stdin); 
    freopen("XORcipher.out","w",stdout); 
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    for(int j=1;j<=n;j++)cin>>b[j];
    dfs(1);
    return 0;
} 
/*
10
1 2 3 4 5 6 10 9 8 7
0 1 2 9 11 12 13 14 15 10

*/