enqueue 1
enqueue 2
enqueue 3
dequeue
dequeue
END

1
2

class QueueWithStacks:
    def __init__(self): self.in_s=[]; self.out_s=[]
    def enqueue(self, v): self.in_s.append(v)
    def dequeue(self):
        if not self.out_s:
            while self.in_s: self.out_s.append(self.in_s.pop())
        return self.out_s.pop() if self.out_s else 'EMPTY'

q=QueueWithStacks(); results=[]
while True:
    line=input().strip()
    if line=='END': break
    parts=line.split()
    if parts[0]=='enqueue': q.enqueue(int(parts[1]))
    else: results.append(str(q.dequeue()))
for r in results: print(r)