#include <bits/stdc++.h>
using namespace std;
const char IO_MODE = 3;
inline long long ReadInt() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline void WriteInt(long long x) {
  char CH[20];
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  int Num = 0;
  if (!x) {
    putchar('0');
    return;
  }
  while (x > 0) CH[++Num] = x % 10, x /= 10;
  while (Num) putchar(CH[Num--] + 48);
}
inline void out(int x) {
  if (IO_MODE & 1)
    WriteInt(x);
  else
    printf("%i", x);
}
template <typename... Args>
inline void out(int x, Args... args) {
  out(x);
  putc(' ', stdout);
  out(args...);
}
inline void in(int &x) {
  if (IO_MODE & 2)
    x = ReadInt();
  else
    scanf("%i", &x);
}
template <typename... Args>
inline void in(int &x, Args &...args) {
  in(x);
  in(args...);
}
inline void outll(long long x) {
  if (IO_MODE & 1)
    WriteInt(x);
  else
    printf("%I64d", x);
}
template <typename... Args>
inline void outll(long long x, Args... args) {
  outll(x);
  putc(' ', stdout);
  outll(args...);
}
inline void inll(long long &x) {
  if (IO_MODE & 2)
    x = ReadInt();
  else
    scanf("%I64d", &x);
}
template <typename... Args>
inline void inll(long long &x, Args &...args) {
  inll(x);
  inll(args...);
}
int aa, bb, cc, dd, ee, ff, gg, hh, ii, jj, kk, mm, nn, oo, pp, qq, rr, ss, tt,
    uu, vv, ww, xx, yy, zz;
int tc;
int n, q, p, mask;
int A[1 << 22];
long long Ans[22];
long long More[2][22];
inline long long build(int l, int r, int lev) {
  if (l == r) return 0;
  long long L_ans = build(l, l + r >> 1, lev - 1);
  long long R_ans = build((l + r >> 1) + 1, r, lev - 1);
  long long ans = 0, L_more = 0, R_more = 0;
  int tmp[r - l + 1];
  int i = 0, j = 0, k = 0;
  int *L = &A[l];
  int *R = &A[(l + r >> 1) + 1];
  int N = r - l + 1 >> 1;
  while (k < N << 1) {
    if (i == N)
      while (j < N) tmp[k++] = R[j++], R_more += i;
    else if (j == N)
      while (i < N) tmp[k++] = L[i++], L_more += j;
    else if (L[i] < R[j])
      while (i < N && L[i] < R[j]) tmp[k++] = L[i++], L_more += j;
    else if (L[i] > R[j])
      while (j < N && L[i] > R[j]) tmp[k++] = R[j++], R_more += i;
    else {
      int pre_i = i;
      int pre_j = j;
      int pre_k = k;
      int val = L[i];
      while (i < N && L[i] == val) tmp[k++] = L[i++], L_more += pre_j;
      while (j < N && R[j] == val) tmp[k++] = R[j++], R_more += pre_i;
    }
  }
  N <<= 1;
  for (int i = 0; i < N; i++) L[i] = tmp[i];
  ans += L_ans + R_ans + L_more;
  Ans[lev] += ans;
  More[0][lev] += L_more;
  More[1][lev] += R_more;
  return ans;
}
int main() {
  in(n);
  for (int i = 0; i < 1 << n; i++) in(A[i]);
  build(0, (1 << n) - 1, n);
  in(q);
  while (q--) {
    in(p);
    mask ^= (1 << p + 1) - 1;
    for (int i = 1; i <= n; i++)
      Ans[i] = Ans[i - 1] + More[!!(mask & 1 << i)][i];
    outll(Ans[n]);
    putc('\n', stdout);
  }
}
