You are given a string, containing lowercase English letters. We associate to each letter its position in the alphabet (a → 1, …, z → 26). The score of a contiguous subsequence is defined as the sum of all values associated to the letters in the subsequence.
Your task is to find the maximum score of a contiguous subsequence which contains at most 10 characters.
Input
The first line of input contains the given string.
Output
A single integer: the maximum score defined above.
Constraints
- The string contains at most 20 000 letters.
Sample
| Input | Output | Explanation |
|---|---|---|
| bananananananananana | 75 | A subsequence which yields the maximum score of 75 is nanananana. |
