You are given an integer sequence of length n, a_1, ..., a_n. Let us consider performing the following n operations on an empty sequence b.

The i-th operation is as follows:

1. Append a_i to the end of b.
2. Reverse the order of the elements in b.



Find the sequence b obtained after these n operations.

Constraints

* 1 \leq n \leq 2\times 10^5
* 0 \leq a_i \leq 10^9
* n and a_i are integers.

Input

Input is given from Standard Input in the following format:


n
a_1 a_2 ... a_n


Output

Print n integers in a line with spaces in between. The i-th integer should be b_i.

Examples

Input

4
1 2 3 4


Output

4 2 1 3


Input

3
1 2 3


Output

3 1 2


Input

1
1000000000


Output

1000000000


Input

6
0 6 7 6 7 0


Output

0 6 6 0 7 7
import java.util.*;

class Main{
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);

		int n = scan.nextInt();
		int[] arr = new int[n];
		int start = (n)/2;
		for(int i = 1; i <= n; i++) {
			if(n%2==0) arr[start + ((i%2!=0)?1:-1) * (i/2)] = scan.nextInt();
			else arr[start + ((i%2==0)?1:-1) * (i/2)] = scan.nextInt();
		}
		System.out.print(arr[0]);
		for(int i = 1; i < n; i++) {
			System.out.print(" "+arr[i]);
		}
		System.out.println();
	}
}
