A priority queue is a data structure which maintains a set $S$ of elements, each of with an associated value (key), and supports the following operations:

* $insert(S, k)$: insert an element $k$ into the set $S$
* $extractMax(S)$: remove and return the element of $S$ with the largest key



Write a program which performs the $insert(S, k)$ and $extractMax(S)$ operations to a priority queue $S$. The priority queue manages a set of integers, which are also keys for the priority.

Constraints

* The number of operations $\leq 2,000,000$
* $0 \leq k \leq 2,000,000,000$

Input

Multiple operations to the priority queue $S$ are given. Each operation is given by "insert $k$", "extract" or "end" in a line. Here, $k$ represents an integer element to be inserted to the priority queue.

The input ends with "end" operation.

Output

For each "extract" operation, print the element extracted from the priority queue $S$ in a line.

Example

Input

insert 8
insert 2
extract
insert 10
extract
insert 11
extract
extract
end


Output

8
10
11
2
import java.util.*;
public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        P_queue S = new P_queue();
        while(true){
            String order = sc.next();
            if(order.equals("insert"))
                S.insert(sc.nextLong());
            else if(order.equals("extract"))
                System.out.println(S.extract());
            else
                break;
        }
    }
}
class P_queue{
    long num[];
    int n = 0;
    P_queue(){
        num = new long[2000010];
    }
    void insert(long k){
        num[++n] = k;
        int i = n;
        while(i > 1){
            if(num[i/2] <= num[i]){
                long tmp = num[i/2];
                num[i/2] = num[i];
                num[i] = tmp;
                i /= 2;
            }
            else
                break;
        }
    }
    long extract(){
        long ans = num[1];
        num[1] = num[n--];
        int i = 1;
        while(true){
            int x = 2*i;
            if(2*i +1 <= n){
                if(num[x] <= num[x+1])
                    x++;
            }
            else if(2*i > n)
                break;
            if(num[i] < num[x]){
                long tmp = num[i];
                num[i] = num[x];
                num[x] = tmp;
                i = x;
            }
            else
                break;
        }
        return ans;
    }
}
