Problem:
Score : 300 points

Problem Statement

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:

Append a_i to the end of b.

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.

Sample Input 1

4
1 2 3 4

Sample Output 1

4 2 1 3

After step 1 of the first operation, b becomes: 1.

After step 2 of the first operation, b becomes: 1.

After step 1 of the second operation, b becomes: 1, 2.

After step 2 of the second operation, b becomes: 2, 1.

After step 1 of the third operation, b becomes: 2, 1, 3.

After step 2 of the third operation, b becomes: 3, 1, 2.

After step 1 of the fourth operation, b becomes: 3, 1, 2, 4.

After step 2 of the fourth operation, b becomes: 4, 2, 1, 3.

Thus, the answer is 4 2 1 3.

Sample Input 2

3
1 2 3

Sample Output 2

3 1 2

As shown above in Sample Output 1, b becomes 3, 1, 2 after step 2 of the third operation. Thus, the answer is 3 1 2.

Sample Input 3

1
1000000000

Sample Output 3

1000000000

Sample Input 4

6
0 6 7 6 7 0

Sample Output 4

0 6 6 0 7 7

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <stdlib.h>

int main()
{
    int apple_tree_quantities = 0;
    scanf("%d",&apple_tree_quantities);
    
    struct apple_tree{
        int positiont;
        int apple_quantitiest;
    };
    
    struct apple_tree *all_information;
    all_information = (struct apple_tree *)malloc(sizeof(struct apple_tree) * apple_tree_quantities);
    
    for(int i = 0;i < apple_tree_quantities;i++)
    {
        int position = 0;
        scanf("%d",&position);
        all_information[i].positiont = position;
        int apple_quantities = 0;
        scanf("%d",&apple_quantities);
        all_information[i].apple_quantitiest =apple_quantities;
    }
    
    for(int i = 0;i < apple_tree_quantities - 1;i++)
    {
        for(int r = i + 1;r < apple_tree_quantities;r++)
        {
            if(all_information[i].positiont > all_information[r].positiont)
            {
                int station_position = all_information[i].positiont;
                int station_apple_quantities = all_information[i].apple_quantitiest;
                all_information[i].positiont = all_information[r].positiont;
                all_information[i].apple_quantitiest = all_information[r].apple_quantitiest;
                all_information[r].positiont = station_position;
                all_information[r].apple_quantitiest = station_apple_quantities;
            }
        }
    }
    
    int negative = 0;
    int positive = 0;
    for(int i = 0;i < apple_tree_quantities;i++)
    {
        if(all_information[i].positiont > 0)
        {
            positive++;
        }
        else
        {
            negative++;
        }
    }
    
    if(positive == 0)
    {
        for(int i = 0;i < apple_tree_quantities;i++)
        {
            if(all_information[i].positiont > 0)
            {
                printf("%d",all_information[i - 1].apple_quantitiest);
                break;
            }
        }
    }
    else
    {
        if(negative == 0)
        {
            for(int i = 0;i < apple_tree_quantities;i++)
            {
                if(all_information[i].positiont > 0)
                {
                    printf("%d",all_information[i].apple_quantitiest);
                    break;
                }
            }
        }
        else if((positive == negative) || (positive == negative + 1) || (negative == positive + 1))
        {
            int sum = 0;
            for(int i = 0;i < apple_tree_quantities;i++)
            {
                sum = sum + all_information[i].apple_quantitiest;
            }
            printf("%d",sum);
        }
        else if(positive > negative && positive - negative > 1)
        {
            int sum = 0;
            for(int i = 0;i < 2 * negative + 1;i++)
            {
                sum = sum + all_information[i].apple_quantitiest;
            }
            printf("%d",sum);
        }
        else if((negative > positive) && (negative - positive > 1))
        {
            int sum = 0;
            for(int i = negative - positive - 1;i < apple_tree_quantities;i++)
            {
                sum = sum + all_information[i].apple_quantitiest;
            }
            printf("%d",sum);
        }
    }
    free(all_information);
    return 0;
}