INF = 10 ** 9   # kind of infinity for this task

class MinStack:
    def __init__(self):
        self.stack = list()

    def get_min(self):
        if len(self.stack) == 0:
            return INF
        else:
            return self.stack[-1][1]

    def push(self, value):
        self.stack.append((value, min(value, self.get_min())))

    def pop(self):
        self.stack.pop()


q = int(input())
stack = MinStack()

for i in range(q):
    query = input().split()
    if query[0] == 'push':
        stack.push(int(query[-1]))
    elif query[0] == 'pop':
        stack.pop()
    else:
        print(stack.get_min())