Polycarp has a most loved arrangement a[1… n] comprising of n integers. He worked it out on the whiteboard as follows: he composed the number a1 to the left side (toward the start of the whiteboard); he composed the number a2 to the right side (toward the finish of the whiteboard);
Correct answer will be upvoted else Multiple Downvoted. Computer science.
Polycarp has a most loved arrangement a[1… n] comprising of n integers. He worked it out on the whiteboard as follows:
he composed the number a1 to the left side (toward the start of the whiteboard);
he composed the number a2 to the right side (toward the finish of the whiteboard);
then, at that point, as far to the left as could really be expected (yet to the right from a1), he composed the number a3;
then, at that point, as far to the right as could be expected (however to the left from a2), he composed the number a4;
Polycarp kept on going about too, until he worked out the whole succession on the whiteboard.
The start of the outcome appears as though this (obviously, if n≥4).
For instance, assuming n=7 and a=[3,1,4,1,5,9,2], Polycarp will compose a grouping on the whiteboard [3,4,5,2,9,1,1].
You saw the grouping composed on the whiteboard and presently you need to reestablish Polycarp's beloved arrangement.
Input
The principal line contains a solitary positive integer t (1≤t≤300) — the number of experiments in the test. Then, at that point, t experiments follow.
The main line of each experiment contains an integer n (1≤n≤300) — the length of the arrangement composed on the whiteboard.
The following line contains n integers b1,b2,… ,bn (1≤bi≤109) — the arrangement composed on the whiteboard.
Output
Output t replies to the experiments. Each reply — is an arrangement a that Polycarp worked out on the whiteboard.
Step by step
Solved in 4 steps with 1 images
