#ifndef CLASS_MODINT
#define CLASS_MODINT

#include <cstdint>

template <std::uint32_t mod>
class modint {
private:
	std::uint32_t n;
public:
	modint() : n(0) {};
	modint(std::int64_t n_) : n((n_ >= 0 ? n_ : mod - (-n_) % mod) % mod) {};
	static constexpr std::uint32_t get_mod() { return mod; }
	std::uint32_t get() const { return n; }
	bool operator==(const modint& m) const { return n == m.n; }
	bool operator!=(const modint& m) const { return n != m.n; }
	modint& operator+=(const modint& m) { n += m.n; n = (n < mod ? n : n - mod); return *this; }
	modint& operator-=(const modint& m) { n += mod - m.n; n = (n < mod ? n : n - mod); return *this; }
	modint& operator*=(const modint& m) { n = std::uint64_t(n) * m.n % mod; return *this; }
	modint operator+(const modint& m) const { return modint(*this) += m; }
	modint operator-(const modint& m) const { return modint(*this) -= m; }
	modint operator*(const modint& m) const { return modint(*this) *= m; }
	modint inv() const { return (*this).pow(mod - 2); }
	modint pow(std::uint64_t b) const {
		modint ans = 1, m = modint(*this);
		while (b) {
			if (b & 1) ans *= m;
			m *= m;
			b >>= 1;
		}
		return ans;
	}
};

#endif // CLASS_MODINT

#include <vector>
#include <iostream>
using namespace std;
using mint = modint<998244353>;
int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	int N;
	cin >> N;
	vector<long long> C(1 << N), L(1 << N), H(1 << N);
	for (int i = 0; i < 1 << N; ++i) {
		cin >> C[i];
	}
	for (int i = 0; i < 1 << N; ++i) {
		cin >> L[i] >> H[i];
	}
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < 1 << N; ++j) {
			if ((j >> i) & 1) {
				long long lc = C[j - (1 << i)], rc = C[j];
				C[j - (1 << i)] = lc + rc;
				C[j] = lc - rc;
			}
		}
	}
	mint ans = 0;
	for (int i = 0; i < 1 << N; ++i) {
		if (C[i] >= 0) ans += C[i] * H[i];
		else ans += C[i] * L[i];
	}
	ans *= mint(1 << N).inv();
	cout << ans.get() << endl;
	return 0;
}