Problem 3.	Maximum and Minimum Element
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.
4 – Print the minimum element in the stack.
After you go through all of the queries, print the stack in the following format:
"{n}, {n1}, {n2}….., {nn}"
Input
•	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.)
Output
•	For each type 3 or 4 query, print the maximum/minimum element in the stack on a new line
Constraints
•	1 ≤ N ≤ 105
•	1 ≤ x ≤ 109
•	1 ≤ type ≤ 4

Examples
Input
9
1 97
2
1 20
2
1 26
1 20
3
1 91
3
Output
26
20
91, 20, 26

Input
10
2
1 47
1 66
1 32
4
3
1 25
1 16
1 8
4
Output
32
66
8
8, 16, 25, 32, 66, 47