[python] Stacks and Queues > Queues: A Tale of Two Stacks

class MyQueue(object):
    def __init__(self):
        self.my_queue = []
    
    def peek(self):
        return self.my_queue[0]
        
    def pop(self):
        self.my_queue = self.my_queue[1:]
        
    def put(self, value):
        self.my_queue.append(value)

queue = MyQueue()
t = int(input())
for line in range(t):
    values = map(int, input().split())
    values = list(values)
    if values[0] == 1:
        queue.put(values[1])        
    elif values[0] == 2:
        queue.pop()
    else:
        print(queue.peek())