#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b, long long m = 998244353) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % m;
    a = (a * a) % m;
    b >>= 1;
  }
  return res;
}
long long inverse(long long a, long long m = 998244353) {
  return power(a, m - 2, m);
}
int n;
vector<int> a;
vector<pair<long long, long long> > bt, sum;
void merge(int p, int l, int r) {
  vector<int> L, R, res;
  int mid = (l + r) / 2;
  for (int i = l; i <= mid; i++) L.push_back(a[i]);
  for (int i = mid + 1; i <= r; i++) R.push_back(a[i]);
  long long ans1 = 0, ans2 = 0;
  int n1 = L.size(), n2 = R.size();
  for (int i = 0; i < n1; i++) {
    int x = L[i];
    int pos1 = upper_bound(R.begin(), R.end(), x) - R.begin();
    ans2 += n2 - pos1;
    int pos2 = upper_bound(R.begin(), R.end(), x - 1) - R.begin();
    ans1 += pos2;
  }
  bt[p] = make_pair(ans1, ans2);
  int pos1 = 0, pos2 = 0;
  while (pos1 < n1 && pos2 < n2) {
    if (L[pos1] < R[pos2])
      res.push_back(L[pos1++]);
    else
      res.push_back(R[pos2++]);
  }
  while (pos1 < n1) res.push_back(L[pos1++]);
  while (pos2 < n2) res.push_back(R[pos2++]);
  for (int i = l; i <= r; i++) a[i] = res[i - l];
}
void construct(int p, int l, int r, int d) {
  if (l == r) return;
  int mid = (l + r) / 2;
  construct(2 * p + 1, l, mid, d + 1);
  construct(2 * p + 2, mid + 1, r, d + 1);
  merge(p, l, r);
  sum[d].first += bt[p].first;
  sum[d].second += bt[p].second;
}
int main() {
  scanf("%d", &n);
  int p = (1 << n);
  a.resize(p);
  sum.assign(n, make_pair(0, 0));
  for (int i = 0; i < p; i++) scanf("%d", &a[i]);
  bt.resize(p);
  construct(0, 0, p - 1, 0);
  vector<int> type(n, 0);
  int m;
  cin >> m;
  for (int i = 0; i < m; i++) {
    int q;
    scanf("%d", &q);
    q = n - q;
    for (int j = q; j < n; j++) type[j] ^= 1;
    long long ans = 0;
    for (int j = 0; j < n; j++) {
      if (type[j] == 0)
        ans += sum[j].first;
      else
        ans += sum[j].second;
    }
    printf("%lld\n", ans);
  }
}
