#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const long double PI = (long double)(3.1415926535897932384626433832795);
inline bool ispow2(int x) { return (x != 0 && (x & (x - 1)) == 0); }
int msb(unsigned x) {
  union {
    double a;
    int b[2];
  };
  a = x;
  return (b[1] >> 20) - 1023;
}
template <class T>
inline void cinarr(T a, int n) {
  for (int i = 0; i < n; ++i) cin >> a[i];
}
inline long long powmod(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
int fastMax(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ y; }
int fastMin(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ x; }
inline long long gcd(long long a, long long b) {
  long long t;
  while (b) {
    a = a % b;
    t = a;
    a = b;
    b = t;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
const int mx = (1 << 20);
long long arr[mx + 7], brr[mx + 7], temp[mx + 7];
long long pp[mx + 7];
int m;
void fcuk(int depth, int l, int m, int r) {
  int i = l;
  int j = m;
  int k = l;
  while (i <= m - 1 && j <= r) {
    if (arr[i] <= arr[j])
      temp[k++] = arr[i++];
    else {
      temp[k++] = arr[j++];
      pp[depth] += (m - i);
    }
  }
  while (i <= m - 1) temp[k++] = arr[i++];
  while (j <= r) temp[k++] = arr[j++];
  for (int i = l; i <= r; i++) {
    arr[i] = temp[i];
  }
}
void annihilate(int depth, int left, int right) {
  if (left == right) return;
  int mid = (left + right) >> 1;
  annihilate(depth + 1, left, mid);
  annihilate(depth + 1, mid + 1, right);
  fcuk(depth, left, mid + 1, right);
}
long long first[2][mx + 7];
int state[mx + 7];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  m = (1 << n);
  for (int i = 0; i < m; i++) {
    cin >> arr[i];
    brr[i] = arr[i];
  }
  annihilate(0, 0, m - 1);
  for (int i = 0; i <= n; i++) {
    first[0][i] = pp[i];
  }
  reverse(brr, brr + m);
  for (int i = 0; i < m; i++) {
    arr[i] = brr[i];
  }
  memset(pp, 0, sizeof(pp));
  memset(temp, 0, sizeof(temp));
  annihilate(0, 0, m - 1);
  for (int i = 0; i <= n; i++) {
    first[1][i] = pp[i];
  }
  long long ans = 0ll;
  for (int i = 0; i <= n; i++) {
    ans += first[0][i];
    state[i] = 0;
  }
  int q;
  cin >> q;
  while (q--) {
    int x;
    cin >> x;
    x = n - x;
    for (int i = x; i <= n; i++) {
      state[i] ^= 1;
    }
    ans = 0ll;
    for (int i = 0; i <= n; i++) {
      ans += first[state[i]][i];
    }
    cout << ans << "\n";
  }
  return 0;
}
