Problem Statement

"Suidousui" is a palindrome

Decompose a string $S$ into $k (\geq 1)$ non-empty substrings, and call them $ T_1, T_2, \dots , T_k $ in order from the beginning.
($ S = T_1 + T_2 + \dots + T_k $ , $ |T_i| \geq 1 $)
If $T_i = T_{k-i+1}$ holds for all $i (1 \leq i \leq k)$, the sequence $T( = [T_1,T_2,\dots,T_k] )$ is called a palindromic decomposition of the string $S$.

Output a string $S$ for which $N$ palindromic decompositions are possible.
However, due to judging requirements, $S$ must have a length of at least $1$ and at most $200$, and must consist only of lowercase letters 'a' - 'z'.

Input

$N$

$N$ is an integer and satisfies the following constraint.
$1 \leq N \leq 10^9$

Output

Output a string $S$ for which $N$ palindromic decompositions are possible.
$S$ must have a length of at least $1$ and at most $200$, and must consist only of lowercase letters 'a' - 'z'.

Sample

2

suidousui

3

shinbunshi