totakeornottotake
Source: hackerearth
Difficulty: MEDIUM

Pandey needs your help. As you know, he is on the quest to save the princess. After traveling for a number of days, he has finally reached the palace, but one last battle remains to be fought. However he has only one unit of energy left in him. To win the battle, he needs all the energy he can get. So he is searching for the Wizard of GJ.

GJ agrees to help him if he is willing to play his game. GJ will give him B balloons, one at a time. For each balloon, he will ask Pandey if he wants to take the balloon. If Pandey accepts, his energy level will be changed according to the value and type of the balloon. Otherwise, the balloon is lost forever. 

GJ is hoping to enjoy seeing Pandey regret his choices after every move because Pandey will only know the current balloon offered to him and will have no knowledge of the following ones. However, unknown to GJ, Pandey's brother Vajpayee had been working undercover as GJ's apprentice and knew in advance the values on each of the balloons and also the order in which he would show them to Pandey. So, Pandey knows all the details, and now he needs you to help him select the balloons so that he can maximize his energy. 

Each balloon may be of one of the following types: 
+ X : Taking this balloon will add X to the current energy of Pandey.
- X :  Taking this balloon will subtract X from the current energy of Pandey.
* X :  Taking this balloon will multiply X to the current energy of Pandey.
/ X :  Taking this balloon will divide (integer division) the current energy of Pandey by X.
To simulate this balloon, you can use a standard division operator in most of programming languages.
E.g. 7 / 4 = 1 and (-7) / 4 = -1.
N : Taking this balloon replaces Pandey's energy by its negated value.

Input:
The first line contains T which is the number of test cases.
The first line of every test case contains an integer B which represents the number of magic balloons offered to Pandey by GJ.
B lines follow, each containing one of the 5 possible balloon types in the order in which they are shown to Pandey.

Output:
For each test case, output a line containing the maximum energy Pandey can make with the given balloons offered by GJ. Pandey starts with energy equal to one.

Constraints:

1 ≤ T ≤ 10
1 ≤ B ≤ 50
1 ≤ X ≤ 30
You can assume that it's impossible to get the energy greater than 10^18 or lower than -10^18.

Scoring:

 1 ≤ B ≤ 16 (40 pts)
Original Constraints (60 pts)

SAMPLE INPUT
2
3
N
- 2
N
3
- 1
* 4
/ 2


SAMPLE OUTPUT
3
4

Explanation

Case 1: The maximum energy obtained by Pandey is if he selects all the 3 balloons. So, his energy changes in this manner : 1 -> -1 -> -3 -> 3

Case 2: The maximum energy obtained by Pandey is if he selects only the second balloon (the one with of type "* 4".


'''
# Read input from stdin and provide input before running code

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''

def solve():
	n = int(input())
	a, b = 1, 1
	for i in range(n):
		line = input()
		if line == 'N':
			a, b = min(a, -b), max(-a, b)
		else:
			x = int(line.split(' ')[1])
			op = line[0]
			if op == '+':
				a, b = min(a, a + x), max(b, b + x)
			elif op == '-':
				a, b = min(a, a - x), max(b, b - x)
			elif op == '*':
				a, b = min(a, a * x, b * x), max(b, a * x, b * x)
			else:
				a, b = min(a, a // x, b // x), max(b, a // x, b // x)
	print(b)

t = int(input())
for i in range(t):
	solve()


tc=int(input())
while tc:
	tc=tc-1
	B=int(input())
	Min=1
	Max=1
	while B:
		B-=1
		N=input()
		if len(N)==1:
			
			Min1=min(-1*Min,-1*Max,Min)
			Max1=max(-1*Min,-1*Max,Max)
			Min=Min1
			Max=Max1
			#print 'After Negation',Min,Max
		else:
			if N[0]=='+':
				Min1=min(Min+int(N[2:]),Max+int(N[2:]),Min)
				Max1=max(Min+int(N[2:]),Max+int(N[2:]),Max)
				Min=Min1
				Max=Max1
				#print 'After +',Min,Max
			elif N[0]=='-':
				Min1=min(Min-int(N[2:]),Max-int(N[2:]),Min)
				Max1=max(Min-int(N[2:]),Max-int(N[2:]),Max)
				Min=Min1
				Max=Max1
				#print 'After -',Min,Max
			elif N[0]=='*':
				Min1=min(Min*int(N[2:]),Max*int(N[2:]),Min)
				Max1=max(Min*int(N[2:]),Max*int(N[2:]),Max)
				Min=Min1
				Max=Max1
				#print 'After *',Min,Max
			elif N[0]=='/':
				Min1=min(Min//int(N[2:]),Max//int(N[2:]),Min)
				Max1=max(Min//int(N[2:]),Max//int(N[2:]),Max)
				Min=Min1
				Max=Max1
				#print 'After /',Min,Max
	print(Max)
			
		
		
	


for tc in range(int(input())):
	n = int(input())
	inst = [[s for s in input().split()] for _ in range(n)]
	energies = {1}
	for ins in inst:
		if ins[0] == 'N':
			energies |= {-num for num in energies}
		else:
			ins[1] = int(ins[1])
			if ins[0] == '+':
				energies |= {num + ins[1] for num in energies}
			elif ins[0] == '-':
				energies |= {num - ins[1] for num in energies}
			elif ins[0] == '*':
				energies |= {num * ins[1] for num in energies}
			else:
				energies |= {int(num / ins[1]) for num in energies}
		energies = {min(energies), max(energies)}
	print((max(energies)))


def find(a,t,x):
	if t=='N': return -a
	elif t=='+': return a+x
	elif t=='-': return a-x
	elif t=='*': return a*x
	elif t=='/': return a/x

for _ in range(eval(input())):
	n=eval(input())
	mi=ma=1
	for i in range(n):
		t=input().strip()
		x=1
		if t[0]!='N': x=int(t[2:])
		t=t[0]
		l=[mi,ma,find(mi,t,x),find(ma,t,x)]
		l.sort()
		mi,ma=l[0],l[-1]
	print(ma)


def find(a,t,x):
	if t=='N': return -a
	elif t=='+': return a+x
	elif t=='-': return a-x
	elif t=='*': return a*x
	elif t=='/': return a/x

for _ in range(eval(input())):
	n=eval(input())
	mi=ma=1
	for i in range(n):
		t=input().strip()
		x=1
		if t[0]!='N': x=int(t[2:])
		t=t[0]
		l=[mi,ma,find(mi,t,x),find(ma,t,x)]
		l.sort()
		mi,ma=l[0],l[-1]
	print(ma)