Problem: Mashmokh's boss, Bimokh, didn't like Mashmokh. So he fired him. Mashmokh decided to go to university and participate in ACM instead of finding a new job. He wants to become a member of Bamokh's team. In order to join he was given some programming tasks and one week to solve them. Mashmokh is not a very experienced programmer. Actually he is not a programmer at all. So he wasn't able to solve them. That's why he asked you to help him with these tasks. One of these tasks is the following.

You have an array a of length 2n and m queries on it. The i-th query is described by an integer qi. In order to perform the i-th query you must:

  * split the array into 2n - qi parts, where each part is a subarray consisting of 2qi numbers; the j-th subarray (1 ≤ j ≤ 2n - qi) should contain the elements a[(j - 1)·2qi + 1], a[(j - 1)·2qi + 2], ..., a[(j - 1)·2qi + 2qi]; 
  * reverse each of the subarrays; 
  * join them into a single array in the same order (this array becomes new array a); 
  * output the number of inversions in the new a. 



Given initial array a and all the queries. Answer all the queries. Please, note that the changes from some query is saved for further queries.

Input

The first line of input contains a single integer n (0 ≤ n ≤ 20). 

The second line of input contains 2n space-separated integers a[1], a[2], ..., a[2n] (1 ≤ a[i] ≤ 109), the initial array.

The third line of input contains a single integer m (1 ≤ m ≤ 106). 

The fourth line of input contains m space-separated integers q1, q2, ..., qm (0 ≤ qi ≤ n), the queries.

Note: since the size of the input and output could be very large, don't use slow output techniques in your language. For example, do not use input and output streams (cin, cout) in C++.

Output

Output m lines. In the i-th line print the answer (the number of inversions) for the i-th query.

Examples

Input

2
2 1 4 3
4
1 2 0 2


Output

0
6
6
0


Input

1
1 2
3
0 1 1


Output

0
1
0

Note

If we reverse an array x[1], x[2], ..., x[n] it becomes new array y[1], y[2], ..., y[n], where y[i] = x[n - i + 1] for each i.

The number of inversions of an array x[1], x[2], ..., x[n] is the number of pairs of indices i, j such that: i < j and x[i] > x[j].

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 1048600;
long long arr[N], temp[N];
pair<long long, long long> tree[4 * N];
long long r_count[25], f_count[25];
long long n;
long long lev(long long x) {
  long long l = 0;
  while (x) x /= 2, l++;
  return n - l;
}
void traverse(long long u, long long st, long long en) {
  cout << u << " " << tree[u].first << "  " << tree[u].second << endl;
  if (st == en) return;
  long long mid = (st + en) / 2;
  traverse(2 * u, st, mid);
  traverse(2 * u + 1, mid + 1, en);
}
pair<long long, long long> _mergeSort(long long u, long long left,
                                      long long right);
pair<long long, long long> merge(long long left, long long mid,
                                 long long right);
pair<long long, long long> mergeSort(long long array_size) {
  return _mergeSort(1, 0, array_size - 1);
}
pair<long long, long long> _mergeSort(long long u, long long left,
                                      long long right) {
  long long mid;
  long long inv_count = 0, for_count = 0;
  if (right > left) {
    mid = (right + left) / 2;
    pair<long long, long long> a = _mergeSort(2 * u, left, mid);
    pair<long long, long long> b = _mergeSort(2 * u + 1, mid + 1, right);
    pair<long long, long long> c = merge(left, mid + 1, right);
    inv_count = c.first;
    for_count = c.second;
  }
  tree[u] = pair<long long, long long>(inv_count, for_count);
  r_count[lev(u)] += tree[u].first;
  f_count[lev(u)] += tree[u].second;
  return pair<long long, long long>(inv_count, for_count);
}
pair<long long, long long> merge(long long left, long long mid,
                                 long long right) {
  long long i, j, k;
  long long inv_count = 0, for_count = 0;
  i = left;
  j = mid;
  k = left;
  int eq = 1, tt = 0;
  sort(arr + left, arr + mid - 1);
  sort(arr + mid, arr + right + 1);
  for (int i = left; i < mid; i++) {
    if (arr[i] > arr[right])
      inv_count += (right - mid + 1);
    else
      inv_count += (lower_bound(arr + mid, arr + right, arr[i]) - (arr + mid));
    if (arr[i] >= arr[right]) continue;
    for_count += (right - mid + 1) -
                 (upper_bound(arr + mid, arr + right, arr[i]) - (arr + mid));
  }
  return pair<long long, long long>(inv_count, for_count);
}
int main() {
  scanf("%lld", &n);
  long long p = 1;
  long long cc = n;
  while (cc--) p *= 2;
  for (long long i = 0; i < p; i++) cin >> arr[i];
  mergeSort(p);
  long long m;
  scanf("%lld", &m);
  while (m--) {
    long long q;
    scanf("%lld", &q);
    long long ans = 0;
    for (long long i = 0; i < q; i++) swap(r_count[i], f_count[i]);
    for (long long i = 0; i <= n; i++) ans += r_count[i];
    printf("%lld\n", ans);
  }
  return 0;
}