#GYM104669B. String Shifts
String Shifts
Description
You are given a string that has been encrypted by shifting each letter by a certain number (for example, 'a' shifted by 1 is 'b'). Given that the word "tino" is in the unencrypted string, print the number of possible shift numbers that could have been used to form the encrypted string. (0 counts as a shift number.)
A string consisting only of lowercase letters. $0 \le length \le 1000$
The number of possible shift numbers that could have been used
Input
A string consisting only of lowercase letters. $0 \le length \le 1000$
Output
The number of possible shift numbers that could have been used
tinoujopvkpq
3