N-th Resonant String

Given an integer n, generate the N-th lexicographically smallest resonant string defined as the concatenation of the substring "abb" repeated n times. Formally, the resonant string can be represented as \(\text{abb} \times n\), where \( n \) is a positive integer.

For example, if \( n = 1 \), the resonant string is "abb"; if \( n = 2 \), the resonant string is "abbabb"; and if \( n = 3 \), the resonant string is "abbabbabb".

inputFormat

The input consists of a single integer n from the standard input.

\( 1 \leq n \leq 10^6 \)

outputFormat

Output the resonant string which is the concatenation of the substring "abb" repeated n times to the standard output.

1

abb