This is a hacker rank challenge.

This question is designed to help you get a better understanding of basic heap operations. You will be given queries of types:

• "1 v" - Delete the element v from the heap.
• "2 v" - Add an element v to the heap.
• "3" - Print the minimum of all the elements in the heap.
• "4" - Print the number of elements in the heap.

NOTE: It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct elements will be in the heap.

Input Format

The first line contains the number of queries, Q. Each of the next Q lines contains a single query of any one of the 3 above mentioned types.

Constraints

Output Format

For each query of type 3, print the minimum value on a single line. Similarly, for each query of type 4, print the number of elements in the heap on a single line.

Sample Input 0

6 2 4 2 9 3 1 4 3 4 

Sample Output 0

4 9 1

Explanation 0 After the first 2 queries, the heap contains {4,9}. Printing the minimum gives 4 as the output. Then, the 4th query deletes 4 from the heap, and the 5th query gives 9 as the output. Similarly, the sixth query prints the number of elements existing in the heap