{"trustable":true,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027$$$$$$\u0027, right: \u0027$$$$$$\u0027, display: true},\n {left: \u0027$$$\u0027, right: \u0027$$$\u0027, display: false},\n {left: \u0027$$\u0027, right: \u0027$$\u0027, display: true},\n {left: \u0027$\u0027, right: \u0027$\u0027, display: false}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eVasily Tadokorov is a stringologist. He thinks a string is fragrant if it can be divided into two parts: \u003cspan class\u003d\"tex-font-style-tt\"\u003enunhehheh\u003c/span\u003e as the prefix and a number of (excluding $$$0$$$) \u003cspan class\u003d\"tex-font-style-tt\"\u003ea\u003c/span\u003e as the suffix. For example, \u003cspan class\u003d\"tex-font-style-tt\"\u003enunhehhehaaaaaa\u003c/span\u003e is fragrant, but \u003cspan class\u003d\"tex-font-style-tt\"\u003enunhehheh\u003c/span\u003e and \u003cspan class\u003d\"tex-font-style-tt\"\u003enunhehhehoooaaa\u003c/span\u003e are not fragrant.\u003c/p\u003e\u003cp\u003eToday Vasily Tadokorov has some strings consisting of lowercase English letters. For each string, he wants to know how many subsequences of this string are fragrant. A string $$$a$$$ is a subsequence of a string $$$b$$$ if $$$a$$$ can be obtained from $$$b$$$ by deletion of several (including $$$0$$$) characters.\u003c/p\u003e\u003cp\u003eThe above is a problem of string that Vasily came up with. As we know, a problem usually has several examples for better understanding. However, Vasily gets buried in making some fragrant examples. After 2000 years, he finally makes two perfect examples as follows.\u003c/p\u003e\u003cp\u003eExample 1:\u003c/p\u003e\u003cul\u003e \u003cli\u003e Input: $$$\\texttt{nunhehhehahaahahahahahahaahaahahahahha}$$$ \u003c/li\u003e\u003cli\u003e Output: $$$\\text{114514}$$$ \u003c/li\u003e\u003c/ul\u003e\u003cp\u003eExample 2:\u003c/p\u003e\u003cul\u003e \u003cli\u003e Input: $$$\\texttt{nunhehhehhehhahaahahahaahaahahaaaahaa}$$$ \u003c/li\u003e\u003cli\u003e Output: $$$\\text{1919810}$$$ \u003c/li\u003e\u003c/ul\u003e\u003cp\u003eVasily is not clever enough. He doesn\u0027t want to work for another 2000 years, so he asks you for help. He gives you $$$T$$$ tasks, each of which contains an integer $$$n$$$, and you should construct a string consisting of only lowercase English letters that has \u003cspan class\u003d\"tex-font-style-bf\"\u003eexactly\u003c/span\u003e $$$n$$$ fragrant subsequences.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line contains an integer $$$T$$$ ($$$1 \\leq T \\leq 1000$$$), denoting the number of tasks.\u003c/p\u003e\u003cp\u003eEach of the next $$$T$$$ lines contains an integer $$$n$$$ ($$$0 \\leq n \\leq 10^9$$$).\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each test case, output one string consisting of only lowercase English letters in a single line indicating the answer. You need to ensure that the sum of the length over all the output strings does not exceed $$$10^6$$$. It can be proved that a solution always exists. If there are multiple solutions, print any.\u003c/p\u003e"}},{"title":"Examples","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2\n114514\n1919810\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003enunhehhehahaahahahahahahaahaahahahahha\nnunhehhehhehhahaahahahaahaahahaaaahaa\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}