A queue is an abstract data type that maintains the order in which elements were added to it, allowing the oldest elements to be removed from the front and new elements to be added to the rear. This is called a First-In-First-Out(FIFO) data structure because the first element added to the queue (i.e., the one that has been waiting the longest) is always the first one to be removed. A basic queue has the following operations: Enqueue: add a new element to the end of the queue. Dequeue: remove the element from the front of the queue and return it. In this challenge, you must first implement a queue ADT.

Then process queries, where each query is one of the following types:

1 x: Enqueue element into the end of the queue.

2: Dequeue the element at the front of the queue.

3: Print the element at the front of the queue. Input Format The first line contains a single integer, q, denoting the number of queries. Each line i of the q subsequent lines contains a single query in the form described in the problem statement above.

All three queries start with an integer denoting the query type, but only query 1 is followed by an additional space-separated value x, denoting the value to be enqueued.

Constraints 1<=q<=105 1<= type <=3 1<= |x|<=109

It is guaranteed that a valid answer always exists for each query of type 3.

Output Format For each query of type 3, print the value of the element at the front of the queue on a new line.