PROGRAMMING:alphabet
We define a lowercase string as "alphabetic" if and only if it removes some characters, it can become "abcdefghijklmnopqrstuvwxyz".
Given a lowercase character string of length N, how many characters must be inserted to make it "alphabetic".
###Input format:
Enter an integer t (1 < = T < = 100) in the first line to represent the number of test data groups, and then enter t lines. Each line is a string of characters s (1 = < n < = 50) composed of lowercase letters' a '-'z'.
###Output format:
Output the minimum number of characters to be inserted in order to make s "alphabetic". Each output takes one line.
###Input example:
```in
two
xyzabcdefghijklmnopqrstuvw
aiemckgobjfndlhp
```
###Output example:
```out
three
twenty
```
answer：If there is no answer, please comment
Given a lowercase character string of length N, how many characters must be inserted to make it "alphabetic".
###Input format:
Enter an integer t (1 < = T < = 100) in the first line to represent the number of test data groups, and then enter t lines. Each line is a string of characters s (1 = < n < = 50) composed of lowercase letters' a '-'z'.
###Output format:
Output the minimum number of characters to be inserted in order to make s "alphabetic". Each output takes one line.
###Input example:
```in
two
xyzabcdefghijklmnopqrstuvw
aiemckgobjfndlhp
```
###Output example:
```out
three
twenty
```
answer：If there is no answer, please comment