Problem:
Deque

For a dynamic array $A = \{a_0, a_1, ...\}$ of integers, perform a sequence of the following operations:

push($d$, $x$): Add element $x$ at the begining of $A$, if $d = 0$. Add element $x$ at the end of $A$, if $d = 1$.

randomAccess($p$): Print element $a_p$.

pop($d$): Delete the first element of $A$, if $d = 0$. Delete the last element of $A$, if $d = 1$.

$A$ is a 0-origin array and it is empty in the initial state.

Input

The input is given in the following format.

$q$
$query_1$
$query_2$
:
$query_q$

Each query $query_i$ is given by

0 $d$ $x$

or

1 $p$

or

2 $d$

where the first digits 0, 1 and 2 represent push, randomAccess and pop operations respectively.

randomAccess and pop operations will not be given for an empty array.

Output

For each randomAccess, print $a_p$ in a line.

Constraints

$1 \leq q \leq 400,000$

$0 \leq p < $ the size of $A$

$-1,000,000,000 \leq x \leq 1,000,000,000$

Sample Input 1

11
0 0 1
0 0 2
0 1 3
1 0
1 1
1 2
2 0
2 1
0 0 4
1 0
1 1

Sample Output 1

2
1
3
4
1

Solution in C (judge verdict: Time Limit Exceeded)

/*
 * ID: ITP2_1_B
 * Problem: Deque
 */

#include <stdio.h>

int main(void)
{
    int a[400000];
    int n_query;
    int last = 0;
    int i;

    scanf("%d", &n_query);
    for (i = 0; i < n_query; i++) {
        int query, index, value;
        int j;
        scanf("%d %d", &query, &index);
        switch (query) {
            case 0: // push(index, value)
                scanf("%d", &value);
                if (index == 0) {
                    for (j = last; j >= 0; j--)
                        a[j + 1] = a[j];
                    a[0] = value;
                    last++;
                } else {
                    a[last++] = value;
                }
                break;
            case 1: // randomAccess(index)
                printf("%d\n", a[index]);
                break;
            case 2: // pop(index)
                if (index == 0) {
                    for (j = 1; j <= last; j++)
                        a[j - 1] = a[j];
                    last--;
                } else {
                    last--;
                }
                break;
        }
    }

    return 0;
}