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


*.*.
....
*.*.
....
**
**
**
**
*.*
*.*
...
.....
.**..
.....
.**..
.....
....
....
**..
**..
import java.util.Scanner;

public class Q2{
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int t = s.nextInt();
		while (t-- > 0) {
			int n = s.nextInt();
			int r1 = 0, r2 = 0, c1 = 0, c2 = 0;
			char[][] arr = new char[n][n];
			boolean flag = false;
			for (int i = 0; i < n; i++) {
				arr[i] = s.next().toCharArray();
				for (int j = 0; j < n; j++) {
					char ch = arr[i][j];
					
					if (ch == '*' && flag) {
						r2 = i;
						c2 = j;
					}
					if (ch == '*' && !flag) {
						r1 = i;
						c1 = j;
						flag = true;
					}
				}

			}
if (c1 == c2) {
				if (c1 == n - 1) {
					arr[r1][c1 - 1] = '*';
					arr[r2][c2 - 1] = '*';
				} else {
					arr[r1][c1 + 1] = '*';
					arr[r2][c2 + 1] = '*';
				}
			} 
			 else if (r1 == r2) {
				if (r1 == n - 1) {
					arr[r1 - 1][c1] = '*';
					arr[r1 - 1][c2] = '*';
				} else {
					arr[r1 + 1][c1] = '*';
					arr[r1 + 1][c2] = '*';
				}
			} else {
				arr[r1][c2] = '*';
				arr[r2][c1] = '*';
			}
			for (int i = 0; i < n; i++) {
				for (int j = 0; j < n; j++) {
					System.out.print(arr[i][j]);
				}
				System.out.println();
			}
		}
	}
}