Question
Print String
You are given a sequence of 26 integers P=(P1, P2, …, P26 ) consisting of integers from 1 to 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 (1 ≤ i ≤ 26), the i- th character of S is the lowercase English letter that comes Pi- th in alphabetical order.
Input
The input contains 26 space separated integers as follows:
P1 P2. . P26
Constraints
1≤Pi≤26
All values in input are integers.
P1 P2. . P26
Constraints
1≤Pi≤26
All values in input are integers.
Output
Print the string S.
Example
Sample Input 1
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
Sample Output 1
abcdefghijklmnopqrstuvwxyz
Sample Input 2
2 1 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
Sample Output 2
bacdefghijklmnopqrstuvwxyz
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
Sample Output 1
abcdefghijklmnopqrstuvwxyz
Sample Input 2
2 1 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
Sample Output 2
bacdefghijklmnopqrstuvwxyz