human
You are given an integer n. Find any string s of length n consisting only of English lowercase letters such that each non-empty substring of s occurs in s an odd number of times. If there are multiple such strings, output any. It can be shown that such string always exists under the given constraints.

A string a is a substring of a string b if a can be obtained from b by deletion of several (possibly, zero or all) characters from the beginning and several (possibly, zero or all) characters from the end.

Input

The first line contains a single integer t (1 ≤ t ≤ 500) — the number of test cases.

The first line of each test case contains a single integer n (1 ≤ n ≤ 10^5).

It is guaranteed that the sum of n over all test cases doesn't exceed 3 ⋅ 10^5.

Output

For each test case, print a single line containing the string s. If there are multiple such strings, output any. It can be shown that such string always exists under the given constraints.

Example

Input

4
3
5
9
19

Output

abc
diane
bbcaabbba
youarethecutestuwuu

Note

In the first test case, each substring of "abc" occurs exactly once.

In the third test case, each substring of "bbcaabbba" occurs an odd number of times. In particular, "b" occurs 5 times, "a" and "bb" occur 3 times each, and each of the remaining substrings occurs exactly once.
Solve the task in PYTHON3.
 ... Can you provide a Python program to find any string s of length n consisting only of English lowercase letters such that each non-empty substring of s occurs in s an odd number of times?
assistant
#Here is Python program to find any string s of length n consisting only of English lowercase letters such that each non-empty substring of s occurs in s an odd number of times.

'''
                ___                       ____                     
  ____ _____ _____/ (_)_  ______  ____ _____/ / /_  __  ______ ___  __
 / __ `/ __ `/ __  / / / / / __ \/ __ `/ __  / __ \/ / / / __ `/ / / /
/ /_/ / /_/ / /_/ / / /_/ / /_/ / /_/ / /_/ / / / / /_/ / /_/ / /_/ / 
\__,_/\__,_/\__,_/_/\__,_/ .___/\__,_/\__,_/_/ /_/\__, /\__,_/\__, /  
                        /_/                      /____/      /____/   
'''
import os.path
from math import gcd, floor, ceil
from collections import *
import sys
mod = 1000000007
INF = float('inf')
def st(): return list(sys.stdin.readline().strip())
def li(): return list(map(int, sys.stdin.readline().split()))
def mp(): return map(int, sys.stdin.readline().split())
def inp(): return int(sys.stdin.readline())
def pr(n): return sys.stdout.write(str(n)+"\n")
def prl(n): return sys.stdout.write(str(n)+" ")

if os.path.exists('input.txt'):
    sys.stdin = open('input.txt', 'r')
    sys.stdout = open('output.txt', 'w')

def solve():
    def check(ans):
        n = len(ans)
        for i in range(n):
            for j in range(i, n):
                p = ans[i:j+1]
                c = 0
                size = j - i + 1
                for x in range(n-size+1):
                    if ans[x:x+size] == p:
                        c += 1
                if c % 2 == 0:
                    print(p, c)
                    return
    n = inp()
    if n == 1:
        ans = 'a'
    elif n % 2 == 0:
        ans = n//2*'a' + 'b' + (n//2-1)*'a'
    else:
        ans = n//2*'a' + 'b' + (n//2-1)*'a'+'c'
    # check(ans)
    pr(ans)

for _ in range(inp()):
    solve()