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.*;

public class Main
{
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int t=sc.nextInt();
		while(t-->0){
		    int n=sc.nextInt();
		    char a[][]=new char[n][n];
		    int a1=-1,a2=-1,a3=-1,a4=-1;
		    for(int i=0;i<n;i++){
		        String s=sc.next();
		        for(int j=0;j<n;j++){
		            a[i][j]=s.charAt(j);
		            if(a[i][j]=='*'&& a1==-1&&a2==-1){
		                a1=i;
		                a2=j;
		            }
		            else if(a[i][j]=='*'&& a3==-1&&a4==-1){
		                a3=i;
		                a4=j;
		            }
		        }
		    }
		    int b1=-1,b2=-1,b3=-1,b4=-1;
		  //  System.out.println(a1+" "+a2+" "+a3+" "+a4);
		    if(a1==a3){
		        b2=a2;
		        b4=a4;
		        if(a1+1<n) b1=a1+1;
		        else b1=a1-1;
		        if(a3+1<n) b3=a3+1;
		        else b3=a3-1;
		    }
		    else if(a1!=a3&&a2!=a4){
		        b1=a1;
		        b2=a4;
		        b3=a3;
		        b4=a2;
		    }
		    else if(a2==a4){
		        b1=a1;
		        b3=a3;
		        if(a2+1<n)b2=a2+1;
		        else b2=a2-1;
		        if(a4+1<n)b4=a4+1;
		        else b4=a4-1;
		    }
		    //System.out.println(b1+" "+b2+" "+b3+" "+b4);
		    a[b1][b2]='*';
		    a[b3][b4]='*';
		    for(int i=0;i<n;i++){
		        for(int j=0;j<n;j++){
		            System.out.print(a[i][j]);
		        }
		        System.out.println();
		    }
		    
		    
		}
	}
}
