The chef is trying to solve some pattern problems, Chef wants your help to code it. Chef has one number K to form a new pattern. Help the chef to code this pattern problem.
-----Input:-----
- First-line will contain $T$, the number of test cases. Then the test cases follow. 
- Each test case contains a single line of input, one integer $K$. 
-----Output:-----
For each test case, output as the pattern.
-----Constraints-----
- $1 \leq T \leq 100$
- $1 \leq K \leq 100$
-----Sample Input:-----
4
1
2
3
4
-----Sample Output:-----
*
*
*
*
***
***
*
*
***
***
*****
*****
*
*
***
***
*****
*****
*******
*******
-----EXPLANATION:-----
No need, else pattern can be decode easily.
for _ in range(int(input())):
    n = int(input())
    s = '*'

    for i in range(n):
        x = ' ' * ((n * 2 - 1 - len(s)) // 2)

        print(x + s + x)
        print(x + s + x)

        s = '*' + s + '*'
for _ in range(int(input())):
    n = int(input())
    s = '*'

    for i in range(n):
        x = ' ' * ((n * 2 - 1 - len(s)) // 2)

        print(x + s + x)
        print(x + s + x)

        s = '*' + s + '*'