AquaMoon has a string $a$ consisting of only $0$ and $1$. She wants to add $+$ and $-$ between all pairs of consecutive positions to make the absolute value of the resulting expression as small as possible. Can you help her?


-----Input-----

The first line contains a single integer $t$ ($1 \leq t \leq 2000$)  – the number of test cases. The description of test cases follows.

The first line of each test case contains a single integer $n$ ($2 \leq n \leq 100$) — the length of $a$.

The second line of each test case contains a string $a$ of length $n$, consisting of only $0$ and $1$.


-----Output-----

For each test case, output a string of length $n - 1$ consisting of $-$ and $+$ on a separate line. If there is more than one assignment of signs that produces the smallest possible absolute value, any of them is accepted.


-----Examples-----

Input
3
2
11
5
01101
5
10001
Output
-
+-++
+++-


-----Note-----

In the first test case, we can get the expression $1 - 1 = 0$, with absolute value $0$.

In the second test case, we can get the expression $0 + 1 - 1 + 0 + 1 = 1$, with absolute value $1$.

In the third test case, we can get the expression $1 + 0 + 0 + 0 - 1 = 0$, with absolute value $0$.

Difficulty: EASY

Solutions:
import sys

def fn(s):
	checked = s[0] == '1'
	output = ''
	for char in s[1:]:
		if char == '1':
			if checked:
				output += '-'
				checked = False
			else:
				output += '+'
				checked = True
		else:
			output += '+'
	return output
input = sys.stdin.readlines()
t = int(input[0].strip('\n'))
for i in range(t):
	input_string = input[2 * i + 2].strip('\n')
	print(fn(input_string))


import sys
import math

def input_parse_expression(input_lines, case_num):
	length = int(input_lines[2 * case_num + 1])
	s = input_lines[2 * case_num + 2]
	return (length, s)

def solve(test_case_input):
	(n, s) = test_case_input
	sum = int(s[0])
	ans = ''
	for c in s[1:]:
		if c == '1':
			ans += '-' if sum else '+'
			sum = 1 - sum
		else:
			ans += '+'
	return ans

def main():
	input_str = sys.stdin.read()
	input_lines = input_str.strip().split('\n')
	n_cases = int(input_lines[0])
	for i in range(n_cases):
		test_case_input = input_parse_expression(input_lines, i)
		solution = solve(test_case_input)
		print(solution)
main()


import sys

def solve():
	inp = sys.stdin.readline
	n = int(inp())
	now = 0
	r = []
	for v in inp().strip():
		if v == '1':
			if now == 1:
				r.append('-')
			else:
				r.append('+')
			now ^= 1
		else:
			r.append('+')
	r.pop(0)
	print(''.join(r))

def main():
	for i in range(int(sys.stdin.readline())):
		solve()
main()


def solve(s):
	ans = ''
	flag = False
	for char in s:
		if char == '1':
			if flag == True:
				flag = False
				ans += '-'
			else:
				flag = True
				ans += '+'
		else:
			ans += '+'
	return ans[1:]
t = int(input())
for _ in range(t):
	n = int(input())
	print(solve(input()))


import sys
input = sys.stdin.readline

def readList():
	return list(map(int, input().split()))

def readInt():
	return int(input())

def readInts():
	return map(int, input().split())

def readStr():
	return input().strip()

def solve():
	n = readInt()
	a = readStr()
	curr = int(a[0])
	ans = []
	for i in range(1, n):
		if a[i] == '0':
			ans.append('+')
		elif curr:
			ans.append('-')
			curr = 0
		else:
			ans.append('+')
			curr += 1
	return ''.join(ans)
for _ in range(int(input())):
	print(solve())


import sys
input = sys.stdin.readline
import math

def print_str_line(str):
	sys.stdout.write(str + '\n')

def print_number(number):
	print_str_line(f'{number}')

def ans(string):
	count_1 = 0
	if string[0] == '1':
		count_1 = 1
	ans = []
	for i in range(1, len(string)):
		if string[i] == '0':
			ans.append('+')
		elif count_1 == 0:
			ans.append('+')
			count_1 = 1
		else:
			ans.append('-')
			count_1 = 0
	return ''.join(ans)
number_of_inputs = int(input())
for i in range(number_of_inputs):
	string_len = input()
	string = input()[:-1]
	_ans = ans(string)
	print_str_line(_ans)


def main():
	t = int(input())
	result = []
	for i in range(t):
		n = int(input())
		a = [char for char in input()]
		count_one = 0
		assignment_signs = []
		for j in range(0, n):
			if a[j] == '1':
				count_one += 1
				if count_one % 2 == 0:
					assignment_signs.append('-')
				else:
					assignment_signs.append('+')
			elif a[j] == '0':
				assignment_signs.append('+')
		assignment_signs.pop(0)
		result.append(''.join(assignment_signs))
	print(*result, sep='\n')
main()


def sol(a):
	out = ''
	cum = a[0]
	for i in range(1, len(a)):
		if cum == a[i] == '1':
			out += '-'
			cum = '0'
		elif cum == a[i] == '0':
			out += '+'
			cum = '0'
		else:
			out += '+'
			cum = '1'
	return out
a = '0100000001'
test = int(input())
for ii in range(test):
	n = int(input())
	a = input()
	print(sol(a))


import sys
import math
t = int(input())
for _ in range(t):
	n = int(input())
	s = input()
	ans = ''
	c = int(s[0])
	s = s[1:]
	for i in s:
		if i == '0':
			ans += '+'
		elif c == 1 and i == '1':
			c = 0
			ans += '-'
		else:
			ans += '+'
			c = 1
	print(ans)


def exe():
	f = 0
	cnt = 0
	st = ''
	if s[0] == '1':
		cnt += 1
	for i in range(1, n):
		if s[i] == '1':
			cnt += 1
			if cnt % 2 == 0:
				f = 1
				st += '-'
			else:
				f = 0
				st += '+'
		else:
			st += '+'
	return st
for i in range(int(input())):
	n = int(input())
	s = input()
	print(exe())


n = int(input())
for i in range(n):
	ans = ''
	cnt = int(input())
	num = list(input())
	a = int(num[0])
	if a == 0:
		x = 0
	else:
		x = 1
	for j in range(cnt - 1):
		if num[j + 1] == '0':
			ans += '+'
		else:
			x += 1
			if x % 2 == 0:
				ans += '-'
			else:
				ans += '+'
	print(ans)


import sys
import os
tc = int(input())
for _ in range(tc):
	n = int(input())
	arr = input()
	isGenap = arr[0] == '0'
	res = []
	for i in range(1, n):
		if arr[i] == '0':
			res.append('+')
		else:
			if isGenap:
				res.append('+')
			else:
				res.append('-')
			isGenap = not isGenap
	print(''.join(res))


for _ in range(int(input())):
	n = int(input())
	s = input()
	c = int(s[0])
	ans = ''
	for x in s[1:]:
		if x == '0':
			ans += '+'
		elif c:
			ans += '-'
			c = 0
		else:
			ans += '+'
			c = 1
	print(ans)