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.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;

public class Main {

    public static void main( String... args ) throws Exception {

        BufferedReader in = new BufferedReader( new InputStreamReader( System.in ) );
        String input = in.readLine();

        List<String> inputList = new ArrayList<>();
        List<String> outputList = new ArrayList<>();

        while ( input != null ) {
            inputList.add( input );
            input = in.readLine();
        }

        int number = Integer.parseInt( inputList.get( 0 ) );
        String array[] = inputList.get( 1 ).split( " " );

        for ( int i = number; i > 0; i = i - 2 ) {
            outputList.add( array[i - 1] );
        }

        for ( int i = (number % 2); i < number; i = i + 2 ) {
            outputList.add( array[i] );
        }

        System.out.println( String.join( " ", outputList ) );

    }
}
