Alphabet#8201

Alphabet

1 second
128 megabytes
Very easy

A string of lowercase letters is called alphabetical if deleting zero or more of its letters can result in the alphabet string "abcdefghijklmnopqrstuvwxyz".

Given a string , determine the minimum number of letters to insert anywhere in the string to make it alphabetical.

Input

Contains a string (1 \leq |s| \leq 50). It is guaranteed that consists of lowercase ASCII letters to only.

Output

Print the minimum number of letters that must be inserted in order to make the string alphabetical.

Examples

Example 1

Loading
Loading

Example 2

Loading
Loading