Alphabet Position Encryption

You are given a string s consisting of lowercase English letters. Your task is to encrypt the string by replacing each character with its corresponding position in the alphabet. For example, 'a' is replaced by 1, 'b' by 2, ..., and 'z' by 26.

The encryption process concatenates the numerical representations of each character without any separators. Mathematically, if the input string is s with characters \(s_1, s_2, \ldots, s_n\), then the output is:

[ \text{output} = \text{concat}(\text{value}(s_1),, \text{value}(s_2),, \ldots,, \text{value}(s_n)) ]

where \(\text{value}(c) = c - 'a' + 1\) for each character c.

inputFormat

The input consists of a single line containing the string s (\(1 \leq |s| \leq 1000\)). The string contains only lowercase English letters.

outputFormat

Output a single line with the encrypted string obtained by converting each letter of the input to its corresponding position in the alphabet.

## sample

cab

312

</p>