Favorite Sequence

题意翻译

# 题目描述 Polycarp有一个喜欢的序列a[1...n],由n个整数组成，他在白板上写下这串数列。 - 他写的a1在最左边（在白板一开始的地方）； - 他写下a2在最右边（在白板结束的地方） - 在尽可能向左的地方（但是是从a1向右的地方），他写下了a3 - 在尽可能向右的地方（但是是从a2向左的地方），他写下了a4. - Polycarp一直像这样如此做，直到他在白板上写出整个数列。 结果的一开始看起来像图上一样（当然，n>=4).例如，如果n=7,a=[3,1,4,1,5,9,2],那么Polycarp将会在白板上得到数列[3,4,5,2,9,1,1]. 你看见写在白板上的数列，现在你想要恢复 Polycarp的喜欢的数列

题目描述

Polycarp has a favorite sequence $ a[1 \dots 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. The beginning of the result looks like this (of course, if $ n \ge 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.

输入输出格式

输入格式

The first line contains a single positive integer $ t $ ( $ 1 \le t \le 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 \le n \le 300 $ ) — the length of the sequence written on the whiteboard. The next line contains $ n $ integers $ b_1, b_2,\ldots, b_n $ ( $ 1 \le b_i \le 10^9 $ ) — the sequence written on the whiteboard.

输出格式

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

输入输出样例

输入样例 #1

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

输出样例 #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

说明

In the first test case, the sequence $ a $ 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] $ .