Implement a data structure with the next operations:
Push x to the end of the structure.
Pop the last element from the structure.
Print the minimum element in the structure.
The first line contains the number of operations n(1≤n≤106). Each of the next n lines contains one operation. The i-th line contains the number ti — the type of operation:
1 in the case of a push operation;
2 in the case of a pop operation;
3 if the operation asks to find minimum;
In the case of a push operation, next comes the integer x(−109≤x≤109) — element to be inserted into the structure. It is guaranteed that before each pop or getMin operation the structure is not empty.
For each getMin operation, print on a separate line one number — the minimal element in the structure.