<? echo $row['title']." - ".$MSG_PROBLEM."

Time Limit: 2 sec / Memory Limit: 1024 MB

Score :

200

points

You are given a sequence of

26

integers

P = (P1，P2, .... p26)

consisting of integers from

1

through

26

. It is guaranteed that all elements in

P

are distinct.
Print a string

S

of length

26

that satisfies the following condition.

For every $i$ $\leq i \leq 26)$ , the $i$ -th character of $S$ is the lowercase English letter that comes $P_i$ -th in alphabetical order.

Input is given from Standard Input in the following format:

P1，P2, .... p26

Print the string

S