CF1931A.Recovering a Small String

Nikita had a word consisting of exactly $3$ lowercase Latin letters. The letters in the Latin alphabet are numbered from $1$ to $26$, where the letter "a" has the index $1$, and the letter "z" has the index $26$.

He encoded this word as the sum of the positions of all the characters in the alphabet. For example, the word "cat" he would encode as the integer $3 + 1 + 20 = 24$, because the letter "c" has the index $3$ in the alphabet, the letter "a" has the index $1$, and the letter "t" has the index $20$.

However, this encoding turned out to be ambiguous! For example, when encoding the word "ava", the integer $1 + 22 + 1 = 24$ is also obtained.

Determine the lexicographically smallest word of $3$ letters that could have been encoded.

A string $a$ is lexicographically smaller than a string $b$ if and only if one of the following holds:

• $a$ is a prefix of $b$, but $a \ne b$;
• in the first position where $a$ and $b$ differ, the string $a$ has a letter that appears earlier in the alphabet than the corresponding letter in $b$.

尼基塔有一个恰好由 $3$ 个小写拉丁字母组成的单词。拉丁字母表中的字母编号为 $1$ 到 $26$，其中字母 “a” 的编号为 $1$，字母 “z” 的编号为 $26$。

他将该单词编码为其中所有字符在字母表中的位置编号之和。例如，单词 “cat” 将被编码为整数 $3 + 1 + 20 = 24$，因为字母 “c” 在字母表中的编号为 $3$，字母 “a” 的编号为 $1$，字母 “t” 的编号为 $20$。

然而，这种编码方式是有歧义的！例如，对单词 “ava” 进行编码也会得到整数 $1 + 22 + 1 = 24$。

请确定所有可能被如此编码的、长度为 $3$ 的单词中，字典序最小的那个。

字符串 $a$ 字典序小于字符串 $b$，当且仅当满足以下任一条件：

• $a$ 是 $b$ 的前缀，但 $a \ne b$；
• 在 $a$ 和 $b$ 首次出现不同字符的位置上，$a$ 中该位置的字母在字母表中出现在 $b$ 中对应位置字母之前。

The first line of the input contains a single integer $t$ ($1 \le t \le 100$) — the number of test cases in the test.

This is followed by the descriptions of the test cases.

The first and only line of each test case contains an integer $n$ ($3 \le n \le 78$) — the encoded word.

输入的第一行包含一个整数 $t$（$1 \le t \le 100$），表示测试用例的数量。

接下来是各测试用例的描述。

每个测试用例仅有一行，包含一个整数 $n$（$3 \le n \le 78$），表示编码后的单词。

For each test case, output the lexicographically smallest three-letter word that could have been encoded on a separate line.

对于每个测试用例，在单独一行中输出可能被编码的字典序最小的三位字母单词。