22160_PPMM

Suppose there is a queue, in which we could do some operations as follow:

PUSH  X : Means that enqueue a number X ( -2³¹ < X < 2³¹ ) to the tail of the queue.

POP : Means that dequeue a number from the head of the queue.

MINUS : Means that form each number in the queue to its corresponding inverse number, viz. X = -X.

MAX : Means that return the maximum number in the queue.

Notice that for operations POP, MINUS and MAX, if it is no numbers current in the queue, just ignore them.

Given a sequence of operations, then for each "MAX" operation, if this operation is not ignored, you should output the maximum value it returned.

The first line of input there is one integer T ( T ≤ 10 ), giving the number of test cases in the input. For each test case, the first line contains a number N ( N ≤ 2000000 ), representing the quantity of operations. The following N lines give out the detail.

For each "MAX" operation not ignored, output the returned number in a line. Output a blank line between the test cases.

1
6
PUSH -2
MINUS
PUSH -1
MAX
POP
MAX

2
-1