Palindromes
Very hard
Execution time limit is 2 seconds
Runtime memory usage limit is 64 megabytes
Determine the lexicographically smallest string made up of lowercase Latin letters, such that it contains exactly k palindromic substrings.
Input
The input consists of a single integer k (1 ≤ k ≤ 10^6).
Output
Print the desired string.
Examples
Input #1
Answer #1
Submissions 13