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 {
    static int k;
    static ArrayList<Integer>[] div;
    static long[] counts;
    static long[] ties;
    static int[] log;
public static void main(String[] args) throws IOException
{
    input.init(System.in);
    PrintWriter out = new PrintWriter(System.out);
    
    int n = input.nextInt();
    long[] poss = new long[n+1];
    for(int i = 0; i<= n; i++)
    {
        poss[i] = (1l<<(n-i)) * (1l<<(i-1)) * (1l<<(i-1));
    }
    int[] a = new int[1<<n];
    for(int i = 0; i<a.length; i++) a[i] = input.nextInt();
    log = new int[(1<<n)+1];
    for(int i = 0; i<=n; i++) log[1<<i] = i;
    counts = new long[n+1];
    ties = new long[n+1];
    invCount(a);
    //System.out.println(Arrays.toString(a));
    //out.println(Arrays.toString(counts));
    //out.println(Arrays.toString(ties));
    //out.println(Arrays.toString(poss));
    int m = input.nextInt();
    for(int i = 0; i<=n; i++) poss[i] -= ties[i];
    for(int i = 0; i<m; i++)
    {
        int x = input.nextInt();
        for(int k = 0; k<=x; k++)
        {
            counts[k] = poss[k] - counts[k];
        }
        long res = 0;
        for(int k = 0; k<=n; k++) res += counts[k];
        out.println(res);
    }
    
    
    out.close();
}
static long[] merge(int[] arr, int[] left, int[] right) {
    int i = 0, j = 0;
    long count = 0;
    long ties = 0;
    while (i < left.length || j < right.length) {
        if (i == left.length) {
            arr[i+j] = right[j];
            j++;
        } else if (j == right.length) {
            arr[i+j] = left[i];
            i++;
        } 
        else if(left[i] == right[j])
        {
            long old1 = i, old2 = j;
            int cur = left[i];
            while(i < left.length && left[i] == cur)
            {
                arr[i+j] = left[i];
                i++;
            }
            while(j < right.length && right[j] == cur)
            {
                arr[i+j] = right[j];
                j++;
            }
            ties += (long)(i-old1) * (j-old2);
            j--;
        }
        else if (left[i] < right[j]) {
            arr[i+j] = left[i];
            i++;                
        } else {
            arr[i+j] = right[j];
            count += left.length-i;
            j++;
        }
    }
    //System.out.println(ties);
    return new long[]{count, ties};
}

static long invCount(int[] arr) {
    if (arr.length < 2)
        return 0;

    int m = (arr.length + 1) / 2;
    int left[] = Arrays.copyOfRange(arr, 0, m);
    int right[] = Arrays.copyOfRange(arr, m, arr.length);
    long res = invCount(left) + invCount(right);
    long[] merge = merge(arr, left, right);
    res += merge[0];
    counts[log[arr.length]] += merge[0];
    ties[log[arr.length]] += merge[1];
    return res;
}
public static class input {
    static BufferedReader reader;
    static StringTokenizer tokenizer;

    /** call this method to initialize reader for InputStream */
    static void init(InputStream input) {
        reader = new BufferedReader(
                     new InputStreamReader(input) );
        tokenizer = new StringTokenizer("");
    }

    /** get next word */
    static String next() throws IOException {
        while ( ! tokenizer.hasMoreTokens() ) {
            //TODO add check for eof if necessary
            tokenizer = new StringTokenizer(
                   reader.readLine() );
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return Integer.parseInt( next() );
    }
    
    static double nextDouble() throws IOException {
        return Double.parseDouble( next() );
    }
    static long nextLong() throws IOException {
        return Long.parseLong( next() );
    }
}
}