A happy string is a string in which each character is lexicographically greater than its next character. You are given a positive integer N as an input. You need to print the smallest lexicographical string possible of length N.
NOTE: All characters in a happy string are in lowercase.
A single integer N.
Print the lexicographically smallest string of length N.