Favorite Sequence

Favorite Sequence

 

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

• he wrote the number a_1a1​ to the left side (at the beginning of the whiteboard);
• he wrote the number a_2a2​ to the right side (at the end of the whiteboard);
• then as far to the left as possible (but to the right from a_1a1​), he wrote the number a_3a3​;
• then as far to the right as possible (but to the left from a_2a2​), he wrote the number a_4a4​;
• Polycarp continued to act as well, until he wrote out the entire sequence on the whiteboard.

The beginning of the result looks like this (of course, if n \ge 4n≥4).

For example, if n=7n=7 and a=[3, 1, 4, 1, 5, 9, 2]a=[3,1,4,1,5,9,2], then Polycarp will write a sequence on the whiteboard [3, 4, 5, 2, 9, 1, 1][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 tt (1 \le t \le 3001≤t≤300) — the number of test cases in the test. Then tt test cases follow.

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

The next line contains nn integers b_1, b_2,\ldots, b_nb1​,b2​,…,bn​ (1 \le b_i \le 10^91≤bi​≤109) — the sequence written on the whiteboard.

Output

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

Sample 1

Inputcopy	Outputcopy
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	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 aa matches the sequence from the statement. The whiteboard states after each step look like this:

[3] \Rightarrow [3, 1] \Rightarrow [3, 4, 1] \Rightarrow [3, 4, 1, 1] \Rightarrow [3, 4, 5, 1, 1] \Rightarrow [3, 4, 5, 9, 1, 1] \Rightarrow [3, 4, 5, 2, 9, 1, 1][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].

---

#include <iostream>
using namespace std;
int main() 
{
	int n;
	cin>>n;
	while(n--)
	{
		int m;
		cin>>m;
		int a[m+5];
		for(int i=1;i<=m;i++)
		{
			cin>>a[i];
		}
		if(m%2==0)
		{
		
		for(int i=1,j=m;i<m/2&&j>m/2+1;i++,j--)
		{
			cout<<a[i]<<" "<<a[j]<<" ";
		}
		cout<<a[m/2]<<" "<<a[m/2+1]<<endl;
		}
		else
		{
			for(int i=1,j=m;j>i;i++,j--)
			{
				cout<<a[i]<<" "<<a[j]<<" ";
			}
			cout<<a[m/2+1]<<endl;
		}
		
	}
	return 0;
}