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.

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$

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.

Example

Input

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


Output

2
1
3
4
1
// ITP2_1_B Deque
import java.util.Scanner;

class Deque {
  int A[];
  int front = 500000, back = 499999;

  Deque() {
    A = new int[1000000];
  }

  void push(int d, int x) {
    if (d == 0) {
      front--;
      A[front] = x;
    } else {
      back++;
      A[back] = x;
    }
  }

  void pop(int d) {
    if (d == 0) {
      front++;
    } else {
      back--;
    }
  }
}

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    sc.nextInt();
    Deque d = new Deque();
    while (sc.hasNext()) {
      switch (sc.nextInt()) {
        case 0:
          d.push(sc.nextInt(), sc.nextInt());
          break;
        case 1:
          System.out.println(d.A[d.front + sc.nextInt()]);
          break;
        case 2:
          d.pop(sc.nextInt());
      }
    }
  }
}
