Alphabet Position Conversion

This problem requires you to convert a string consisting of lowercase letters into a new string. Each letter must be replaced by its corresponding position in the English alphabet. For example, the letter a should be replaced with 1, b with 2, and so on until z, which should be replaced with 26.

Formally, for each character \( c \) in the string \( s \), you should compute its position as follows:

\[ \text{position}(c) = \text{ord}(c) - \text{ord}('a') + 1 \]

Concatenate all these numbers together to form the final output string.

inputFormat

The input consists of a single line containing a non-empty string \( s \) of lowercase English letters.

outputFormat

Output a single line containing the concatenated string of the positions corresponding to each letter in the input string.

## sample

a

1