Solve in Python:
The chef is trying to solve some pattern problems, Chef wants your help to code it. Chef has one number K(odd) 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 50$
- $1 \leq K \leq 50$

-----Sample Input:-----
4
1
3
5
7

-----Sample Output:-----
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*

-----EXPLANATION:-----
No need, else pattern can be decode easily.
t=int(input())
while(t):
    n=int(input())
    p=int(n/2)
    p=p+1
    for i in range(0,p):
        for j in range(0,i):
            if(j>=0):
                print(end=" ")
        print("*")
    p=p-2
    for i in range(p,0,-1):
        for j in range(0,i):
            print(end=" ")
        print("*")
    
    if(n>1):
        print("*")
    t=t-1