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.io.*;
import java.util.*;

public class P414C
{
    public static StringTokenizer st;
    public static void nextLine(BufferedReader br) throws IOException
    {
        st = new StringTokenizer(br.readLine());
    }
    
    public static String next()
    {
        return st.nextToken();
    }
    
    public static int nextInt()
    {
        return Integer.parseInt(st.nextToken());
    }
    
    public static long nextLong()
    {
        return Long.parseLong(st.nextToken());
    }
    
    public static double nextDouble()
    {
        return Double.parseDouble(st.nextToken());
    }
    
    static int size;
    static int[] arr;
    static long[] invs, ties;
    public static void main(String[] args) throws IOException
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        nextLine(br);
        int n = nextInt();
        size = (1 << n);
        arr = new int[size];
        invs = new long[size + 1];
        ties = new long[size + 1];
        nextLine(br);
        for (int i = 0; i < size; i++)
        {
            arr[i] = nextInt();
        }
        nextLine(br);
        int m = nextInt();
        nextLine(br);
        
        long[] maxes = new long[n+1];
        if (n > 0)
        {
            maxes[1] = (long)(1 << (n-1));
            for (int i = 2; i <= n; i++)
            {
                maxes[i] = maxes[i-1] * 2;
            }
            fill(0, size, 1);
        }
        long ans = 0;
        long[] invsums = new long[n+1];
        
        for (int i = 0; i < n; i++)
        {
            long temp = 0;
            long tties = 0;
            for (int j = (1 << i); j < (1 << (i + 1)); j++)
            {
                temp += invs[j];
                tties += ties[j];
            }
            invsums[n-i] = temp;
            maxes[n-i] -= tties;
            ans += invsums[n-i];
        }
        //System.out.println(Arrays.toString(invsums));
        //System.out.println(Arrays.toString(maxes));
        StringBuffer sb = new StringBuffer();
        for (int i = 0; i < m; i++)
        {
            int q = nextInt();
            if (n == 0)
            {
                sb.append("0\n");
                continue;
            }
            else if (q == 0)
            {
                sb.append(ans + "\n");
                continue;
            }
            for (int j = q; j > 0; j--)
            {
                ans += maxes[j] - 2*invsums[j];
                invsums[j] = maxes[j] - invsums[j];
            }
            sb.append(ans + "\n");
        }
        System.out.println(sb.toString());
    }
    
    private static int[] fill(int start, int end, int index)
    {
        if (end - start == 2)
        {
            if (arr[start] > arr[start + 1])
            {
                invs[index] = 1;
                return new int[] {arr[start+1], arr[start]};
            }
            else
            {
                invs[index] = 0;
                if (arr[start] == arr[start + 1])
                {
                    ties[index] = 1;
                }
                return new int[] {arr[start], arr[start + 1]};
            }
        }
        int sz = end - start;
        int[] ans1 = fill(start, start + sz/2, index * 2);
        int[] ans2 = fill(start + sz/2, end, index * 2 + 1);
        int[] narr = new int[sz];
        int p1 = 0, p2 = 0, ct = 0;
        long val = 0;
        while (p1 < ans1.length && p2 < ans2.length)
        {
            if (ans2[p2] < ans1[p1])
            {
                narr[ct++] = ans2[p2++];
                val += ans1.length - p1;
            }
            else if (ans1[p1] < ans2[p2])
            {
                narr[ct++] = ans1[p1++];
            }
            else
            {
                int p1t = 0, p2t = 0;
                while (p1 + p1t < ans1.length && ans1[p1 + p1t] == ans2[p2])
                {
                    p1t++;
                }
                while (p2 + p2t < ans2.length && ans2[p2 + p2t] == ans1[p1])
                {
                    p2t++;
                }
                ties[index] += (long)p1t * (long)p2t;
                for (int i = 0; i < p1t; i++)
                {
                    narr[ct++] = ans1[p1++];
                }
                for (int i = 0; i < p2t; i++)
                {
                    narr[ct++] = ans2[p2++];
                    val += ans1.length - p1;
                }
            }
        }
        while (p1 < ans1.length)
        {
            narr[ct++] = ans1[p1++];
        }
        while (p2 < ans2.length)
        {
            narr[ct++] = ans2[p2++];
        }
        invs[index] = val;
        return narr;
    }
}