EOJ-自适应编程学习平台

You have an empty sequence, and you will be given $N$ queries. Each query is one of these three types:

1 x  -Push the element x into the stack.
2    -Delete the element present at the top of the stack.
3    -Print the maximum element in the stack.

The first line of input contains an integer, $N$. The next $N$ lines each contain an above mentioned query. (It is guaranteed that each query is valid.) $1 \leq N \leq 10^5$ $1 \leq x \leq 10^9$ $1 \leq type \leq 3$

For each type 3 query, print the maximum element in the stack on a new line.