Problem: Polycarp has a favorite sequence a[1 ... n] consisting of n integers. He wrote it out on the whiteboard as follows:

  * he wrote the number a_1 to the left side (at the beginning of the whiteboard); 
  * he wrote the number a_2 to the right side (at the end of the whiteboard); 
  * then as far to the left as possible (but to the right from a_1), he wrote the number a_3; 
  * then as far to the right as possible (but to the left from a_2), he wrote the number a_4; 
  * Polycarp continued to act as well, until he wrote out the entire sequence on the whiteboard. 

<image> The beginning of the result looks like this (of course, if n ≥ 4).

For example, if n=7 and a=[3, 1, 4, 1, 5, 9, 2], then Polycarp will write a sequence on the whiteboard [3, 4, 5, 2, 9, 1, 1].

You saw the sequence written on the whiteboard and now you want to restore Polycarp's favorite sequence.

Input

The first line contains a single positive integer t (1 ≤ t ≤ 300) — the number of test cases in the test. Then t test cases follow.

The first line of each test case contains an integer n (1 ≤ n ≤ 300) — the length of the sequence written on the whiteboard.

The next line contains n integers b_1, b_2,…, b_n (1 ≤ b_i ≤ 10^9) — the sequence written on the whiteboard.

Output

Output t answers to the test cases. Each answer — is a sequence a that Polycarp wrote out on the whiteboard.

Example

Input


6
7
3 4 5 2 9 1 1
4
9 2 7 1
11
8 4 3 1 2 7 8 7 9 4 2
1
42
2
11 7
8
1 1 1 1 1 1 1 1


Output


3 1 4 1 5 9 2 
9 1 2 7 
8 2 4 4 3 9 1 7 2 8 7 
42 
11 7 
1 1 1 1 1 1 1 1 

Note

In the first test case, the sequence a matches the sequence from the statement. The whiteboard states after each step look like this:

[3] ⇒ [3, 1] ⇒ [3, 4, 1] ⇒ [3, 4, 1, 1] ⇒ [3, 4, 5, 1, 1] ⇒ [3, 4, 5, 9, 1, 1] ⇒ [3, 4, 5, 2, 9, 1, 1].

Solution (in PYTHON3):

Solution:
"""n is apartment no and x is no of apartments at each floor excep the first floor
testcases = int(input())
while testcases > 0:
    n,x = map(int,input().split())
    if n==1 or n==2:
        print(1)
    else:
        i=1
        count=2
        while count<n:
            count+=x
            i+=1
        print(i)
    testcases-=1"""
"""testcases = int(input())
while testcases > 0:
    n = int(input())
    myArray = map(int,input().split())
    total=0
    for i in range(len(myArray)):
        total+=myArray[i]
    if total%2!=0:
        print("NO")
    else:
        total = total/2
        cols = total+1
        myDp = []
        for i in range(len(myArray)+1):
            newList = []
            for j in range(cols):
                newList.append(0)
            myDp.append(newList)"""
"""n=int(input())
myArray=[]
for i in range(n):
    myArray.append(list(map(str,input())))
flag=0
for i in range(n):
    if myArray[i][0]=="O" and myArray[i][1]=="O":
        myArray[i][0]="+"
        myArray[i][1]="+"
        flag=1
        break
    else:
        if myArray[i][3]=="O" and myArray[i][4]=="O":
            myArray[i][3]="+"
            myArray[i][4]="+"
            flag=1
            break
if flag==0:
    print("NO")
else:
    print("YES")
    for i in range(len(myArray)):
        myString=""
        for j in range(len(myArray[i])):
            myString+=myArray[i][j]
        print(myString)"""

testcases = int(input())
while testcases > 0:
    n = int(input())
    myArray = list(map(int,input().split()))
    if len(myArray) == 1 or len(myArray)==2:
        for i in range(len(myArray)):
            print(myArray[i],end=" ")
    else:
        i=0
        j=len(myArray)-1
        myNewArray=[]
        while j>=i:
            if j>i:
                myNewArray.append(myArray[i])
                myNewArray.append(myArray[j])
            else:
                myNewArray.append(myArray[i])
            i+=1
            j-=1
        for i in range(len(myNewArray)):
            print(myNewArray[i],end=" ")
    testcases-=1