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:-----
1
13
57
135
7911
131517
1357
9111315
17192123
25272931

-----EXPLANATION:-----
No need, else pattern can be decode easily.

Difficulty: UNKNOWN_DIFFICULTY

Solutions:
n = int(input())
l = [0] * n
for x in range(n):
	l[x] = int(input())
for i in range(n):
	z = 1
	for j in range(1, l[i] + 1):
		for k in range(1, l[i] + 1):
			print(z, end='')
			z += 2
		print()


t = int(input())
for _ in range(t):
	k = int(input())
	count = 1
	for _ in range(k):
		output = ''
		for index in range(1, k + 1):
			output += str(count)
			count += 2
		print(output)


try:
	for _ in range(int(input())):
		k = int(input())
		num = 1
		for i in range(1, k + 1, 1):
			for j in range(1, k + 1, 1):
				print(num * 2 - 1, end='')
				num = num + 1
			print('')
except:
	pass


for _ in range(0, int(input())):
	a = int(input())
	for i in range(1, a ** 2 * 2, a * 2):
		for j in range(i, a * 2 + i, 2):
			print(j, end='')
		print()


for _ in range(int(input())):
	n = int(input())
	count = 1
	for i in range(n):
		for j in range(n):
			print(count, end='')
			count += 2
		print()


t = int(input())
for t in range(t):
	n = int(input())
	s = 1
	for i in range(1, n + 1):
		for j in range(1, n + 1):
			print(s, end='')
			s += 2
		print()


for i in range(int(input())):
	n = int(input())
	for j in range(0, n):
		s = ''
		for k in range(1, n + 1):
			p = n * j + k
			s += str(2 * p - 1)
		print(s)


from sys import *
input = stdin.readline
t = int(input())
for _ in range(t):
	k = int(input())
	x = 1
	for i in range(k):
		for j in range(k):
			print(x, end='')
			x += 2
		print()


try:
	for i in range(int(input())):
		n = int(input())
		s = 1
		for j in range(1, n + 1):
			for k in range(1, n + 1):
				print(s, end='')
				s += 2
			print('\r')
except Exception:
	pass


for _ in range(int(input())):
	k = int(input())
	x = 1
	for i in range(k):
		for j in range(k):
			print(x, end='')
			x = x + 2
		print()


def solve(n):
	j = 1
	for i in range(1, n + 1):
		for k in range(n):
			print(j, end='')
			j += 2
		print()
for _ in range(int(input())):
	n = int(input())
	solve(n)


t = int(input())
for i in range(t):
	k = int(input())
	for j in range(0, k):
		print(''.join([str(2 * (x + 1) - 1) for x in range(j * k, j * k + k)]))


try:
	tc = int(input())
	for _ in range(tc):
		n = int(input())
		a = 1
		for i in range(n):
			for j in range(n):
				print(a, end='')
				a += 2
			print()
except:
	pass


for case in range(int(input())):
	n = int(input())
	k = 1
	for i in range(0, n):
		for j in range(0, n):
			print(k, end='')
			k += 2
		print('')


for _ in range(int(input())):
	k = int(input())
	s = ''
	count = 1
	for i in range(k):
		for j in range(k):
			s += str(count)
			count += 2
		print(s)
		s = ''


try:
	t = int(input())
	for _ in range(t):
		n = int(input())
		c = 1
		for i in range(n):
			for j in range(n):
				print(c, end='')
				c += 2
			print()
except EOFError:
	pass


for i in range(int(input())):
	k = int(input())
	count = 1
	for j in range(1, k + 1):
		for l in range(1, k + 1):
			print(count, end='')
			count += 2
		print()


for _ in range(int(input())):
	n = int(input())
	if n == 1:
		print('1')
	else:
		p = 1
		for i in range(n):
			for j in range(n):
				print(p, end='')
				p += 2
			print()


t = int(input())
while t:
	n = int(input())
	k = 1
	for i in range(1, n + 1):
		for j in range(1, n + 1):
			print(k, end='')
			k += 2
		print()
	t -= 1