Description

Please implement a binary min heap that supports the following operations:

- `1 x`: Insert number x
- `2`: Remove an element with smallest value in the heap.  If the heap is already empty, ignore this command.
- `3`: Report the smallest number in the heap.  If the heap is already empty, print "EMPTY" (without quotation mark).

Input

The first line contains an integer q, being the number of operations.

The following q lines are the operations described in the problem statements.

Restrictions

- 1 <= q <= 2 * 10⁶
- -10⁹ <= x <= 10⁹

Output

For each query with type 3, print the answer in one line.

Sample Input  Download

Sample Output  Download

Tags

Discuss