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 scan = new Scanner(System.in);
		int b20 = 2_000_000;
		int[] a = new int[b20+1];
		a[0] = 0;

		for(;;){
			String s = scan.next();
			if(s.equals("end"))
				break;
			if(s.equals("insert")){
				int k = scan.nextInt();
				insert(a, k);
			}else if(s.equals("extract"))
				System.out.println(extract(a));
		}

		scan.close();
		System.exit(0);
	}

	private static void insert(int[] a, int k){
		a[0]++;
		a[a[0]] = k;
		up(a, a[0]);
	}
	private static void up(int[] a, int i){
		if(i > 1 && a[i] > a[i/2]){
			int tmp = a[i];
			a[i] = a[i/2];
			a[i/2] = tmp;
			up(a, i/2);
		}
	}

	private static int extract(int[] a){
		int r = a[1];
		a[1] = a[a[0]];
		a[0]--;
		maxHeap(a, 1);
		return r;
	}
	private static void maxHeap(int[] a, int i){
		int l = i * 2;
		int r = i * 2 + 1;
		int max = i;
		if(l <= a[0] && a[l] > a[i])
			max = l;
		if(r <= a[0] && a[r] > a[max])
			max = r;
		if(max != i){
			int tmp = a[i];
			a[i] = a[max];
			a[max] = tmp;
			maxHeap(a, max);
		}
	}
}