#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 1005000
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9
using namespace std;
//using namespace __gnu_pbds;
typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 2> a2;
//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
int mk[N];
ll val[N];
unordered_map <ll, unordered_map <int, int> > mp;
int main()
{
//freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
srand(time(0));
ll n;
cin >> n;
if (n == 1) {cout << 2 << endl; exit(0);}
n = (1 << n);
ll a[n], ans = 0;
for (ll i = 0; i < n; i++) cin >> a[i];
for (ll i = 0; i < n; i++)
{
ll vl = (n - 1) ^ i;
val[i] = rand();
val[vl] = -val[i];
}
mp[0][0]++;
ll sum = 0, xr = 0;
for (ll i = 0; i < n; i++)
{
sum += val[a[i]];
xr ^= a[i];
ans += mp[sum][xr];
mp[sum][xr]++;
}
cout << (n * (n + 1)) / 2 - ans << endl;
}
