#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=998244353;
void FWT(vector<ll> &v){
	int m=v.size();
	for(int i=1; i<m; i<<=1){
		for(int j=0; j<m; j++){
			if((i&j)==0){
				ll x=v[j], y=v[j^i];
				v[j]=x+y, v[j^i]=x-y;
			}
		}
	}
}
int main()
{
	int n;
    cin>>n;
    vector<ll> c(1<<n);
    for(int i=0; i<(1<<n); i++){
        cin>>c[i];
    }
    FWT(c);
    ll ans=0;
    for(int i=0; i<(1<<n); i++){
        ll l, h; cin>>l>>h;
        if(c[i]>0) ans+=c[i]*h;
        else ans+=c[i]*l;
    }
    ans%=MOD;
    for(int i=0; i<n; i++) (ans*=((MOD+1)/2))%=MOD;
    cout<<ans<<endl;
	return 0;
}