Lexicographically Smallest String

Given an integer ( n ) where ( 1 \leq n \leq 26 ), output the lexicographically smallest string containing exactly ( n ) distinct lowercase English letters. The answer is simply the first ( n ) letters of the alphabet. For example, if ( n = 3 ), the output should be abc.

inputFormat

The input consists of a single integer ( n ) provided via standard input (stdin).

outputFormat

Print the lexicographically smallest string of exactly ( n ) distinct characters to standard output (stdout).## sample

1

a