import java.util.Scanner;
import java.util.Stack;

public class Solution {

    private static Stack<Integer> st1;
    private static Stack<Integer> st2;
    private static void enqueue(int x) {

        while (!st1.isEmpty()) {
            st2.push(st1.pop());
        }
       
        st2.push(x);
        while (!st2.isEmpty()) {
            st1.push(st2.pop());
        }
    }
    private static int dequeue() {
        if (st1.isEmpty()) {
            return -1;
        }
        return st1.pop();
    }
    private static int display(){
         if (st1.isEmpty()) {
             return -1;
         }
         return st1.peek();
    }
   
    public static void main(String[] args) {
        st1 = new Stack<>();
        st2 = new Stack<>();
        Scanner sc = new Scanner(System.in);
        int n=sc.nextInt();
        while(n>0)
        {
            int ch=sc.nextInt();
            switch (ch) {
            case 1:
                enqueue(sc.nextInt());
                n--;
                break;
            case 2:
                dequeue();
                n--;
                break;
            case 3:
                System.out.println(display());
                n--;
                break;
            default:
                break;
            }
        }
    }
}

from collections import deque 
d=deque()
q=int(input())
for i in range(q):
    lst=[int(x) for x in input().split()]
    if lst[0]==1:
        d.append(lst[1])
    elif lst[0]==2:
        d.popleft()
    else:
        print(d[0])

a = int(input(""))
queue = []

for i in range(a):
    b = list((input("").split(" ")))
    if b[0] == str(1):
        queue.append(b[1])
    elif b[0] == str(2):
        if queue is None:
            break
        del queue[0]
    elif b[0] == str(3):
        if queue:
            print(queue[0])
    print(queue)

queue = []
for _ in range(int(input())):
    q_type, *value = map(int, input().split())
    if q_type == 1:
        queue.append(*value)
    elif q_type == 2:
        del queue[0]
    else:
        print(queue[0])

n = int(input())
from collections import deque
b = deque()
def queue(a):
    if a[0] == 1:
        b.append(a[1])
    elif a[0] == 2:
        b.popleft()
    elif a[0] == 3:
        print(b[0])

for _ in range(n):
    a = list(map(int, input().rstrip().split()))
    queue(a)