#include <iostream>

#include <vector>

#include <cstdio>

using namespace std;

const int MOD = ;

typedef long long LL;

LL mypow(LL a, LL b){

    LL ans = ; for(; b; b >>= ) { if(b&) (ans *= a) %= MOD; (a *= a) %= MOD; } return ans;

}

LL I2 = mypow(, MOD-);

const int maxn = (<<) + ;

LL a[maxn], b[maxn], A[][maxn*], B[][maxn*], C[][maxn*];

vector<int> Bit[];

int m;

class FWT{

public:

    void fwt(LL *a, int n){

        for(int d = ; d < n; d <<= ){

            for(int m = d<<, i = ; i < n; i += m){

                for(int j = ; j < d; j++){

                    LL x = a[i+j], y = a[i+j+d];

                    a[i+j] = x+y; if(a[i+j] >= MOD) a[i+j] -= MOD;

                    a[i+j+d] = x-y;   if(a[i+j+d] < ) a[i+j+d] += MOD;

                }

            }

        }

    }

    void ufwt(LL *a, int n){

        for(int d = ; d < n; d <<= ){

            for(int m = d<<, i = ; i < n; i += m){

                for(int j = ; j < d; j++){

                    LL x = a[i+j], y = a[i+j+d];

                    a[i+j] = (x+y)*I2%MOD; a[i+j+d] = (x-y+MOD)*I2%MOD;

                }

            }

        }

    }

    void work(LL *a, LL *b, int n){

        fwt(a, n);

        fwt(b, n);

        for(int i = ; i < n; i++) a[i] *= b[i];

        ufwt(a, n);

    }

}myfwt;

int bit(int x){

    int ans = ;

    for(int i = ; i < ; i++)

        ans += ((x&(<<i)) > );

    return ans;

}

int main()

{

    for(int i = ; i < (<<); i++) Bit[bit(i)].push_back(i);

    cin>>m;

    for(int i = ; i < (<<m); i++) scanf("%d", &a[i]);

    for(int i = ; i < (<<m); i++) scanf("%d", &b[i]);

    int L = (<<m);

    for(int i = ; i <= m; i++){

        for(auto x : Bit[i]){

            if(x >= L) break;

            A[i][x] = (a[x]*(<<i))%MOD;

            B[i][x] = b[x];

        }

        myfwt.fwt(A[i], L);

        myfwt.fwt(B[i], L);

    }

    for(int x = ; x <= m; x++)

        for(int y = ; y <= x; y++)

            for(int i = ; i < L; i++)

                (C[x-y][i] += A[y][i]*B[x][i]) %= MOD;

    for(int i = ; i <= m; i++) myfwt.ufwt(C[i], L);

    LL ans = , t = ;

    for(int i = ; i < (<<m); i++){

        (ans += C[bit(i)][i]*t) %= MOD;

        (t *= ) %= MOD;

    }

    cout<<ans<<endl;

    return ;

}