Row Major

Description:

Input:

Each test contains multiple test cases. The first line contains the number of test cases $$$t$$$ ($$$1 \le t \le 10^4$$$). The description of the test cases follows.

The only line of each test case contains a single integer $$$n$$$ ($$$1 \le n \le 10^6$$$).

It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$10^6$$$.

Output:

For each test case, output a string with the minimum number of distinct characters among all suitable strings of length $$$n$$$.

If there are multiple solutions, print any of them.

Sample Input:

4
4
2
1
6

Sample Output:

that
is
a
tomato

Note:

In the first test case, there are $$$3$$$ ways $$$s$$$ can be the row-major order of a grid, and they are all not bad:

t		t	h		t	h	a	t
h		a	t
a
t

It can be proven that $$$3$$$ distinct characters is the minimum possible.

In the second test case, there are $$$2$$$ ways $$$s$$$ can be the row-major order of a grid, and they are both not bad:

i		i	s
s

It can be proven that $$$2$$$ distinct characters is the minimum possible.

In the third test case, there is only $$$1$$$ way $$$s$$$ can be the row-major order of a grid, and it is not bad.

In the fourth test case, there are $$$4$$$ ways $$$s$$$ can be the row-major order of a grid, and they are all not bad:

t

t

o

t

o

m

t

o

m

a

t

o

o

m

a

a

t

o

m

t

o

a

t

o

It can be proven that $$$4$$$ distinct characters is the minimum possible. Note that, for example, the string "orange" is not an acceptable output because it has $$$6 > 4$$$ distinct characters, and the string "banana" is not an acceptable output because it is the row-major order of the following bad grid:

b	a
n	a
n	a