Determine the lexicographically smallest string made up of lowercase Latin letters, such that it contains exactly k palindromic substrings.
The input consists of a single integer k (1 \le k \le 10^6).
Print the desired string.
Example 1
