Palindromes Not Allowed

 It is JJ's birthday and you decide to gift him a string 

S$S$ of length N$N$. But you also know that JJ does not like palindromes so you decide that none of the substrings of S$S$ of length ≥2$\ge 2$ should be a palindrome.

Can you find any suitable string which can be gifted to JJ?

Recall that a string is called palindrome if it reads the same backwards and forwards, for e.g. noon$\mathtt{\text{noon}}$ and level$\mathtt{\text{level}}$ are palindromic strings.

Input Format

• The first line contains T$T$ - the number of test cases. Then the test cases follow.
• The first and only line of each test case contains an integer N$N$ - the length of the string S$S$ to be constructed.

Output Format

For each test case, output a string S$S$ of length N$N$ such that none of its substrings (of length ≥2$\ge 2$) is a palindrome.

If there are multiple strings which satisfy the condition, print any.

Constraints

• 1≤T≤100$1\le T\le 100$
• 1≤N≤1000$1\le N\le 1000$

Sample Input 1 

3
2
2
4

Sample Output 1 

gl
hf
waow

Explanation

Test case 1: gl$\mathtt{\text{gl}}$ is the only substring of length ≥2$\ge 2$ and it is not a palindrome.

Test case 2: hf$\mathtt{\text{hf}}$ is the only substring of length ≥2$\ge 2$ and it is not a palindrome.

Test case 3: Following are the substrings of length ≥2$\ge 2$:

• Length=2$Length=2$: wa$\mathtt{\text{wa}}$, ao$\mathtt{\text{ao}}$, ow$\mathtt{\text{ow}}$
• Length=3$Length=3$: wao$\mathtt{\text{wao}}$, aow$\mathtt{\text{aow}}$
• Length=4$Length=4$: waow$\mathtt{\text{waow}}$

We can see that none of these substrings is a palindrome.

• Tweet
• Share
• Share
• Share
• Share

Related Post