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 JAVA):

Solution:

import java.util.*;
import java.io.*;
public class C {
    public static long time = 0;
    public static void main(String[] args) throws Exception {
        time = System.currentTimeMillis();
        
        IN = System.in;
        OUT = System.out;
        in = new BufferedReader(new InputStreamReader(IN));
        out = new PrintWriter(OUT, FLUSH);
        solveOne();
        out.flush();
    }
    public static void solveOne() throws Exception {
        int n1 = ni();
        int[] l1 = nil(1 << n1);
        long[] count = new long[n1 + 1];
        long[] opp = new long[n1 + 1];
        for (int i = 1; i <= n1; i++){
            int segNo = 1 << (n1 - i);
            int halfLen = 1 << (i - 1);
//          px(i ,segNo,halfLen);
            for (int j = 0; j < segNo; j++){
                int start1 = (j << i);
                int end1 = start1 + (1 << (i - 1) );
                int end2 = start1 + (1 << i) - 1;
                Arrays.sort(l1, start1, end1);
                Arrays.sort(l1, end1, start1 + (1 << i));
                {
                    int ptr = 0;
                    for (int k = 0; k < halfLen; k++){
                        for (;;){
                            if (ptr >= halfLen) break;
                            if (l1[start1 + k] > l1[end1 + ptr]){
                                ptr++;
                            }
                            else {
                                break;
                            }
                        }
                        count[i] += (long)ptr;
                    }
                }
                {
                    int ptr = 0;
                    for (int k = 0; k < halfLen; k++){
                        for (;;){
                            if (ptr >= halfLen) break;
                            if (l1[start1 + k] >= l1[end1 + ptr]){
                                ptr++;
                            }
                            else {
                                break;
                            }
                        }
                        opp[i] += (long)(halfLen - ptr);
                    }
                }
            }
//          px(l1);
        }
//      px(count);
//      px(opp);
//      px(total);
        int m1 = ni();
        for (int qq = 0; qq < m1; qq++){
            int k1 = ni();
            for (int i = 0; i <= k1; i++){
                long temp = count[i];
                count[i] = opp[i];
                opp[i] = temp;
            }
//          px(count);
//          px(opp);
            long sum = 0;
            for (long e: count){
                sum += e;
            }
            pn(sum);
        }
    }
    
    public static void solveTwo() throws Exception {
        
    }
    
    public static void solveThree() throws Exception {
        
    }
    
    public static BufferedReader in;
    public static StringTokenizer st;
    public static InputStream IN;
    public static OutputStream OUT;
    public static String nx() throws Exception {
        for (;st == null || !st.hasMoreTokens();){
            String k1 = in.readLine();
            if (k1 == null) return null;
            st = new StringTokenizer(k1);
        }
        return st.nextToken();
    }
    public static int ni () throws Exception {
        return Integer.parseInt(nx());
    }
    public static long nl() throws Exception{
        return Long.parseLong(nx());
    }
    public static double nd() throws Exception{
        return Double.parseDouble(nx());
    }
    private static int[] nil(int n1) throws Exception {
        int[] l1 = new int[n1];
        for (int i = 0 ;i < n1; i++){
            l1[i] = ni();
        }
        return l1;
    }
    public static void px(Object ... l1){
        System.out.println(Arrays.deepToString(l1));
    }
    public static boolean FLUSH = false;
    public static PrintWriter out;
    public static void p(Object ... l1){
        for (int i = 0; i < l1.length; i++){
            if (i != 0) out.print(' ');
            out.print(l1[i].toString());
        }
    }
    public static void pn(Object ... l1){
        for (int i = 0; i < l1.length; i++){
            if (i != 0) out.print(' ');
            out.print(l1[i].toString());
        }
        out.println();
    }
    
    public static void pn(Collection l1){
        boolean first = true;
        for (Object e: l1){
            if (first) first = false;
            else out.print(' ');
            out.print(e.toString());
        }
        out.println();
    }

}