Score : $200$ points
You are given a sequence of $26$ integers $P=(P_1,P_2, \ldots ,P_{26})$ 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.
Input is given from Standard Input in the following format:
$P_1$ $P_2$ $\ldots$ $P_{26}$
Print the string $S$.
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
abcdefghijklmnopqrstuvwxyz
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
bacdefghijklmnopqrstuvwxyz
5 11 12 16 25 17 18 1 7 10 4 23 20 3 2 24 26 19 14 9 6 22 8 13 15 21
eklpyqragjdwtcbxzsnifvhmou