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


*.*.
....
*.*.
....
**
**
**
**
*.*
*.*
...
.....
.**..
.....
.**..
.....
....
....
**..
**..
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        int l[2], p[2];
        int c=0;
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                char ch;
                cin>>ch;
                if(ch == '*')l[c]=i,p[c]=j,c++;
            }
        }
        int al=l[0], bl=l[1];
        int ap=p[0], bp=p[1];
        int f=0;
        if(ap == bp && ap == n-1 && f==0)ap-=1, f=1;
        else if(ap == bp && ap != n-1 && f==0)ap+=1, f=1;

        if(al == bl && al == n-1 && f==0)al-=1, f=1;
        else if(al == bl && al != n-1 && f==0)al+=1, f=1;

        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                if((al == i && ap==j) || (bl == i && bp==j) || (al == i && bp==j) || (bl == i && ap==j))
                    cout<<'*';
                else
                    cout<<'.';
            }cout<<endl;
        }
    }
    return 0;
}

