#include <bits/stdc++.h>
using namespace std;
const long long int N = 1 << 22, LOGN = 22;
long long int value[N][2], height[LOGN][2];
bool mark[LOGN];
vector<long long int> tree[N];
long long int a[N];
long long int merge(vector<long long int> a, vector<long long int> b,
                    vector<long long int> &c) {
  long long int res = 0;
  long long int n = a.size();
  c.clear();
  long long int i = 0, j = 0;
  while (i < n && j < n) {
    if (a[i] <= b[j])
      c.push_back(a[i]), i++;
    else
      res += n - i, c.push_back(b[j]), j++;
  }
  while (i < n) c.push_back(a[i]), i++;
  while (j < n) c.push_back(b[j]), j++;
  return res;
}
void build(long long int node, long long int s, long long int e,
           long long int ht) {
  if (s == e) {
    tree[node].push_back(a[s]);
    return;
  }
  long long int mid = (s + e) / 2;
  build(2 * node, s, mid, ht - 1);
  build(2 * node + 1, mid + 1, e, ht - 1);
  pair<long long int, long long int> p = {
      merge(tree[2 * node], tree[2 * node + 1], tree[node]),
      merge(tree[2 * node + 1], tree[2 * node], tree[node])};
  value[node][0] = p.first;
  value[node][1] = p.second;
  height[ht][0] += p.first;
  height[ht][1] += p.second;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long int n;
  cin >> n;
  for (long long int i = 1; i <= (1 << n); i++) cin >> a[i];
  build(1, 1, 1 << n, n);
  long long int q;
  cin >> q;
  while (q--) {
    long long int x;
    cin >> x;
    for (long long int i = n; i >= 0; i--)
      if (i <= x) mark[i] ^= 1;
    long long int ans = 0;
    for (long long int i = n; i >= 0; i--) ans += height[i][mark[i]];
    cout << ans << '\n';
  }
}
