P02_MonkAndGobletOfFire.py

# Albus Dumbledore announced that the school will host the legendary event known as Wizard Tournament where
# four magical schools are going to compete against each other in a very deadly competition by facing some
# dangerous challenges. Since the team selection is very critical in this deadly competition. Albus
# Dumbledore asked Little Monk to help him in the team selection process. There is a long queue of students
# from all the four magical schools. Each student of a school have a different roll number. Whenever a
# new student will come, he will search for his schoolmate from the end of the queue. As soon as he will
# find any of the schoolmate in the queue, he will stand behind him, otherwise he will stand at the end of
# the queue. At any moment Little Monk will ask the student, who is standing in front of the queue, to
# come and put his name in the Goblet of Fire and remove him from the queue. There are Q operations of
# one of the following types:
#
# E x y: A new student of school x (1≤x≤4) whose roll number is (1≤y≤50000) will stand in queue according
# to the method mentioned above.
#
# D: Little Monk will ask the student, who is standing in front of the queue, to come and put his name in
# the Goblet of Fire and remove him from the queue
#
# Now Albus Dumbledore asked Little Monk to tell him the order in which student put their name. Little Monk
# is too lazy to that so he asked you to write a program to print required order.
#
# Note: Number of dequeue operations will never be greater than enqueue operations at any point of time.
#
# Input Format:
# First line contains an integer Q (1≤Q≤100000), denoting the number of operations. Next Q lines will contains
# one of the 2 types of operations.
#
# Output Format:
# For each 2nd type of operation, print two space separated integers, the front student's school and roll number.
#
# SAMPLE INPUT
# 5
# E 1 1
# E 2 1
# E 1 2
# D
# D
#
# SAMPLE OUTPUT
# 1 1
# 1 2

def enqueue(myList, element):
  try:
    index = [x for x, y in enumerate(myList) if x == element[0]]
    myList.insert(int(''.join([str(x) for x in index])), element)
  except ValueError:
    myList.insert(0, element)

def dequeue(myList):
  if len(myList) > 0:
    return myList.pop()

myList = []

for _ in range(int(input())):
    userInput = input().split()
    if userInput[0] == 'E':
      enqueue(myList, [int(userInput[1]), int(userInput[2])])
    else:
      deleted = dequeue(myList)
      print(' '.join([str(element) for element in deleted]))