There is a square field of size n × n in which two cells are marked. These cells can be in the same row or column.

You are to mark two more cells so that they are the corners of a rectangle with sides parallel to the coordinate axes.

For example, if n=4 and a rectangular field looks like this (there are asterisks in the marked cells):

$$$ \begin{matrix} . & . & * & . \\\ . & . & . & . \\\ * & . & . & . \\\ . & . & . & . \\\ \end{matrix} $$$

Then you can mark two more cells as follows

$$$ \begin{matrix} * & . & * & . \\\ . & . & . & . \\\ * & . & * & . \\\ . & . & . & . \\\ \end{matrix} $$$

If there are several possible solutions, then print any of them.

Input

The first line contains a single integer t (1 ≤ t ≤ 400). Then t test cases follow.

The first row of each test case contains a single integer n (2 ≤ n ≤ 400) — the number of rows and columns in the table.

The following n lines each contain n characters '.' or '*' denoting empty and marked cells, respectively.

It is guaranteed that the sums of n for all test cases do not exceed 400.

It is guaranteed that there are exactly two asterisks on the field. They can be in the same row/column.

It is guaranteed that the solution exists.

Output

For each test case, output n rows of n characters — a field with four asterisks marked corresponding to the statements. If there multiple correct answers, print any of them.

Example

Input


6
4
..*.
....
*...
....
2
*.
.*
2
.*
.*
3
*.*
...
...
5
.....
..*..
.....
.*...
.....
4
....
....
*...
*...


Output


*.*.
....
*.*.
....
**
**
**
**
*.*
*.*
...
.....
.**..
.....
.**..
.....
....
....
**..
**..


tot = int(input())
for x in range(tot):
	a = int(input())
	# arr = [[] for y in range(a) ]
	idar = []
	for y in range(a):
		b = input()
		# arr[y] = list(b)
		# print(b)
		if len(idar) < 4:
			for pp in range(a):
				if b[pp]=="*":
					idar.append(y)
					idar.append(pp)	
	nid = []	
	if idar[0]==idar[2]:
		if idar[0]==a-1:
			nid.append(idar[0]-1)
			nid.append(idar[1])
			nid.append(idar[2]-1)
			nid.append(idar[3])
		else:
			nid.append(idar[0]+1)
			nid.append(idar[1])
			nid.append(idar[2]+1)
			nid.append(idar[3])
	elif idar[1]==idar[3]:
		if idar[1]==a-1:
			nid.append(idar[0])
			nid.append(idar[1]-1)
			nid.append(idar[2])			
			nid.append(idar[3]-1)
		else:	
			nid.append(idar[0])
			nid.append(idar[1]+1)
			nid.append(idar[2])
			nid.append(idar[3]+1)
			
	else:
		nid.append(idar[0])
		nid.append(idar[3])
		nid.append(idar[2])
		nid.append(idar[1])

	pp = idar[0]
	qq = idar[1]
	rr = idar[2]
	ss = idar[3]
	tt = nid[0] 
	uu = nid[1] 
	vv = nid[2] 
	ww = nid[3] 
	for ff in range(a):
		for hh in range(a):
			if (pp==ff and qq==hh) or (rr==ff and ss==hh) or (tt==ff and uu==hh) or (vv==ff and ww==hh):
				print("*",end="")
			else:
				print(".",end="")
		print()		

	# print(idar)