Inspired by the tv series Stranger Things, bear Limak is going for a walk between two mirror worlds.

There are two perfect binary trees of height H, each with the standard numeration of vertices from 1 to 2^H-1. The root is 1 and the children of x are 2 \cdot x and 2 \cdot x + 1.

Let L denote the number of leaves in a single tree, L = 2^{H-1}.

You are given a permutation P_1, P_2, \ldots, P_L of numbers 1 through L. It describes L special edges that connect leaves of the two trees. There is a special edge between vertex L+i-1 in the first tree and vertex L+P_i-1 in the second tree.

graph for sample1

drawing for the first sample test, permutation P = (2, 3, 1, 4), special edges in green

Let's define product of a cycle as the product of numbers in its vertices. Compute the sum of products of all simple cycles that have exactly two special edges, modulo (10^9+7).

A simple cycle is a cycle of length at least 3, without repeated vertices or edges.

Constraints

* 2 \leq H \leq 18
* 1 \leq P_i \leq L where L = 2^{H-1}
* P_i \neq P_j (so this is a permutation)

Input

Input is given from Standard Input in the following format (where L = 2^{H-1}).


H
P_1 P_2 \cdots P_L


Output

Compute the sum of products of simple cycles that have exactly two special edges. Print the answer modulo (10^9+7).

Examples

Input

3
2 3 1 4


Output

121788


Input

2
1 2


Output

36


Input

5
6 14 15 7 12 16 5 4 11 9 3 10 8 2 13 1


Output

10199246
import static java.lang.Integer.parseInt;
import static java.lang.Long.parseLong;
import static java.lang.System.exit;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main {

	static final int MOD = 1000000007;

	static int add(int a, int b) {
		int res = a + b;
		return res >= MOD ? res - MOD : res;
	}

	static int sub(int a, int b) {
		int res = a - b;
		return res < 0 ? res + MOD : res;
	}

	static int mul(int a, int b) {
		int res = (int) ((long) a * b % MOD);
		return res < 0 ? res + MOD : res;
	}

	static int pow(int a, int e) {
		if (e == 0) {
			return 1;
		}
		int r = a;
		for (int i = 30 - Integer.numberOfLeadingZeros(e); i >= 0; i--) {
			r = mul(r, r);
			if ((e & (1 << i)) != 0) {
				r = mul(r, a);
			}
		}
		return r;
	}

	static int inv(int a) {
		return pow(a, MOD - 2);
	}

	static int h, p[], pprod[], pprodInv[];
	static int ans;

	static void solve() throws Exception {
		h = scanInt();
		p = new int[1 << (h - 1)];
		for (int i = 0; i < p.length; i++) {
			p[i] = scanInt() - 1;
		}
		pprod = new int[1 << h];
		pprodInv = new int[1 << h];
		pprod[1] = pprodInv[1] = 1;
		for (int i = 2; i < 1 << h; i++) {
			pprod[i] = mul(pprod[i / 2], i);
			pprodInv[i] = inv(pprod[i]);
		}
		ans = 0;
		int vs[] = new int[1 << (h - 1)];
		for (int i = 0; i < vs.length; i++) {
			vs[i] = i;
		}
		go(0, 0, 0, 0, vs);
		out.print(mul(ans, (MOD + 1) / 2));
	}

	static void go(int p1, int l1, int p2, int l2, int vs[]) {
		int cnt = 0, sum = 0;
		int nvs[] = new int[vs.length];
		for (int i: vs) {
			int j = p[i];
			if (i >> (h - 1 - l1) == p1 && j >> (h - 1 - l2) == p2) {
				nvs[cnt++] = i;
				sum = add(sum, mul(pprod[(1 << (h - 1)) + i], pprod[(1 << (h - 1)) + j]));
			}
		}
		if (cnt == 0) {
			return;
		}
		nvs = Arrays.copyOf(nvs, cnt);
		int mul = mul(mulAt2(p1, l1), mulAt2(p2, l2));
		ans = add(ans, mul(mul, mul(sum, sum)));
		if (l1 < h - 1) {
			go(2 * p1, l1 + 1, p2, l2, nvs);
			go(2 * p1 + 1, l1 + 1, p2, l2, nvs);
		}
		if (l1 == 0 && l2 < h - 1) {
			go(p1, l1, 2 * p2, l2 + 1, nvs);
			go(p1, l1, 2 * p2 + 1, l2 + 1, nvs);
		}
	}

	static int mulAt(int p, int l) {
		if (l == h - 1) {
			return 0;
		}
		int res = pprodInv[(1 << l) + p];
		if (l > 0) {
			res = mul(res, pprodInv[(1 << (l - 1)) + (p >> 1)]);
		}
		return res;
	}

	static int mulAt2(int p, int l) {
		int res = mulAt(p, l);
		if (l > 0) {
			res = sub(res, mulAt(p >> 1, l - 1));
		}
		return res;
	}

	static int scanInt() throws IOException {
		return parseInt(scanString());
	}

	static long scanLong() throws IOException {
		return parseLong(scanString());
	}

	static String scanString() throws IOException {
		while (tok == null || !tok.hasMoreTokens()) {
			tok = new StringTokenizer(in.readLine());
		}
		return tok.nextToken();
	}

	static BufferedReader in;
	static PrintWriter out;
	static StringTokenizer tok;

	public static void main(String[] args) {
		try {
			in = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(System.out);
			solve();
			in.close();
			out.close();
		} catch (Throwable e) {
			e.printStackTrace();
			exit(1);
		}
	}
}