//DUEL
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#pragma GCC optimize("unroll-loops")
#define shandom_ruffle(a, b) shuffle(a, b, rng)
#define vi vector<int>
#define vl vector<ll>
#define popcnt __builtin_popcount
#define popcntll __builtin_popcountll
#define all(a) begin(a),end(a)

using namespace std;
using namespace __gnu_pbds;

using ll=long long;
using ull=unsigned long long;
using ld=long double;
const int MOD=1000000007;
vector<int> bases;
const ll LLINF=1ll<<60;
const char en='\n';

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void yes() {cout<<"YES"<<en; exit(0);}
void no() {cout<<"NO"<<en; exit(0);}
inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;}
template<class T>
void prVec(vector<T> w,bool fl=false)
{
	cout<<w.size()<<en;
	for (int i=0;i<int(w.size())-1;++i) cout<<w[i]<<' ';
	if (w.size()) cout<<w[w.size()-1]<<en;
	if (fl) cout<<flush;
}

ll raand()
{
	ll a=rund();
	a*=RAND_MAX;
	a+=rund();
    return a;
}

#define rand raand

ll raaand()
{
	return raand()*(MOD-7)+raand();
}

string to_upper(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A';
	return a;
}

string to_lower(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A';
	return a;
}

ll sti(string a,int base=10)
{
	ll k=0;
	for (int i=0;i<(int)a.size();++i)
	{
		k*=base;
		k+=a[i]-'0';
	}
	return k;
}

template<class T>
void eras(vector<T>& a,T b)
{
	a.erase(find(a.begin(),a.end(),b));
}

string its(ll k,int base=10)
{
	if (k==0) return "0";
	string a;
	while (k)
	{
		a.push_back((k%base)+'0');
		k/=base;
	}
	reverse(a.begin(),a.end());
	return a;
}

ll min(ll a,int b)
{
	if (a<b) return a;
	return b;
}

ll min(int a,ll b)
{
	if (a<b) return a;
	return b;
}

ll max(ll a,int b)
{
	if (a>b) return a;
	return b;
}

ll max(int a,ll b)
{
	if (a>b) return a;
	return b;
}

ll gcd(ll a,ll b)
{
	if (b==0) return a;
	return gcd(b,a%b);
}

ll lcm(ll a,ll b)
{
	return a/gcd(a,b)*b;
}

template<class T,class K>
pair<T,K> mp(T a,K b)
{
	return make_pair(a,b);
}

inline int mult(ll a,ll b)
{
	return (a*b)%MOD;
}

inline int pot(int n,int k)
{
	if (k==0) return 1;
	ll a=pot(n,k/2);
	a=mult(a,a);
	if (k%2) return mult(a,n);
	else return a;
}

int divide(int a,int b)
{
	return mult(a,pot(b,MOD-2));
}

inline int sub(int a,int b)
{
	if (a-b>=0) return a-b;
	return a-b+MOD;
}

inline int add(int a,int b)
{
	if (a+b>=MOD) return a+b-MOD;
	return a+b;
}

bool prime(ll a)
{
	if (a==1) return 0;
	for (int i=2;i<=round(sqrt(a));++i)
	{
		if (a%i==0) return 0;
	}
	return 1;
}

const int N=300010;
int t,n,an,h[N],pu[N],pr[N],ipr[N],m,cus;
string st[N];

int lca(int a,int b)
{
	//cout<<"lca "<<a<<' '<<b;
	while (a!=b)
	{
		if (a>b) a/=2;
		else b/=2;
	}
	//cout<<"="<<a<<endl;
	return a;
}

void sol2(int l,int r,vector<pair<pair<string,int>,int>>&v)
{
	//cout<<l<<' '<<r<<endl;
	if (l==r-1) return;
	int mid=l+1;
	int si=v[l].x.x.size();
	while (mid<r && v[mid].x.x[si]=='0') ++mid;
	sol2(l+1,mid,v);
	sol2(mid,r,v);
	int sa1=0,sa2=0,sb1=0,sb2=0;
	for (int i=l+1;i<mid;++i) if (v[i].y<0) sb1=add(sb1,mult(-v[i].y,mult(pr[v[i].x.y],ipr[v[l].x.y])));
	else sa1=add(sa1,mult(v[i].y,mult(pr[v[i].x.y],ipr[v[l].x.y])));
	for (int i=mid;i<r;++i) if (v[i].y<0) sb2=add(sb2,mult(-v[i].y,mult(pr[v[i].x.y],ipr[v[l].x.y])));
	else sa2=add(sa2,mult(v[i].y,mult(pr[v[i].x.y],ipr[v[l].x.y])));
	//cout<<sa1<<' '<<sb1<<' '<<sa2<<' '<<sb2<<endl;
	cus=add(cus,mult(mult(sa1,sb2),v[l].x.y));
	cus=add(cus,mult(mult(sa2,sb1),v[l].x.y));
}

void solve(int l,int r,int i)
{
	//cout<<"solve "<<l<<' '<<r<<' '<<i<<endl;
	if (l==r-1) return;
	int mid=(l+r)/2;
	solve(l,mid,i*2);
	solve(mid,r,i*2+1);
	vector<pair<pair<string,int>,int>> v;
	vi v1;
	for (int j=l;j<r;++j)
	{
		pu[j]=mult(pr[j+m],ipr[i]);
		if (j<mid) v.eb(mp(st[h[j]+m],h[j]+m),pu[j]);
		else v.eb(mp(st[h[j]+m],h[j]+m),-pu[j]);
		v1.pb(h[j]+m);
	}
	sort(all(v1));
	for (int i=1;i<v1.size();++i) v.eb(mp(st[lca(v1[i-1],v1[i])],lca(v1[i-1],v1[i])),0);
	sort(all(v));
	v.erase(unique(all(v)),v.end());
	/*for (auto a: v)
	{
		cout<<a.x.x<<' '<<a.x.y<<' '<<a.y<<endl;
	}*/
	cus=0;
	sol2(0,v.size(),v);
	an=add(an,mult(cus,i));
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	for (int i=0;i<10;++i) bases.push_back(rand()%(MOD-13893829*2)+13893829);
	cin>>n;
	m=1<<(n-1);
	pr[1]=1;
	for (int i=2;i<2*m;++i) pr[i]=mult(i,pr[i/2]);
	for (int i=1;i<2*m;++i) ipr[i]=divide(1,pr[i]);
	for (int i=1;i<2*m;++i) st[i]=its(i,2);
	for (int i=0;i<m;++i)
	{
		cin>>h[i],--h[i];
		//h[i]=i;
	}
	solve(0,m,1);
	cout<<an<<en;
}





Measured memory_bytes: 52676