#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int C = 26;
void add(int &x, int y) {
  x += y;
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
}
int fix(int x) {
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
  return x;
}
int pw(int a, int b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = 1ll * ret * a % MOD;
    b >>= 1;
    a = 1ll * a * a % MOD;
  }
  return ret;
}
const int LOG = 20;
const int MAXN = (1 << LOG) + 10;
int n, a[MAXN];
long long inv[LOG + 1][2], lz[LOG + 1];
void go(int l, int r, int dep = n) {
  if (r - l == 1) {
    assert(dep == 0);
    return;
  }
  int m = (l + r) >> 1;
  go(l, m, dep - 1);
  go(m, r, dep - 1);
  int len = m - l;
  vector<int> left(len), right(len);
  copy(a + l, a + m, left.begin());
  copy(a + m, a + r, right.begin());
  array<long long, 2> me;
  for (int rot = 0; rot < 2; rot++) {
    long long &ans = me[rot] = 0;
    int i = 0, j = 0;
    while (i < len) {
      if (j < len && left[i] > right[j]) {
        ++j;
        continue;
      }
      ans += j;
      i++;
    }
    swap(left, right);
  }
  merge(left.begin(), left.end(), right.begin(), right.end(), a + l);
  for (int i = 0; i < 2; i++) {
    inv[dep][i] += me[i];
  }
}
void solve() {
  cin >> n;
  for (int i = 0; i < (1 << n); i++) {
    cin >> a[i];
  }
  int m;
  cin >> m;
  go(0, (1 << n));
  while (m--) {
    int dep;
    cin >> dep;
    for (int i = dep; ~i; --i) {
      lz[i] ^= 1;
    }
    long long tot = 0;
    for (int i = 0; i <= n; i++) {
      tot += inv[i][lz[i]];
    }
    cout << tot << "\n";
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int te = 1;
  for (int w = 1; w <= te; w++) {
    solve();
  }
  return 0;
}
