Rahul likes odd numbers. One more time he tries to create something having odd count. He has a number n (1 to 10^7) and try to create a string of length 'n' using lower case letters which will have all the substrings odd number of counts. EX: aaba having a->3, ->1,aa->1,aab->1,aba->1 and so on You are given an integer 'n'. Create a lexicographically smallest string with odd count of all substrings.
Input Format
Integer 'n'
Output Format
String str
Constraints
1<=n<=10^7
Notice
NA
Example
Input
5
Output
abaac