You know, TT very loves to eat vegetable, especially for Chinese cabbage. By the way, another name of Mr. Cai is Chinese cabbage.
One day, TT received a strange message from Mr. Cai. It seems all garbled. But TT did not give up - she wants to find whether there's a substring "chinesecabbage" in it.
What's more, TT would like to find the biggest Chinese Cabbage because she is too fond of it.
The definition of "biggest Chinese Cabbage" is that the position of last 'e' minus the position of first 'c' is biggest.
Your task is help TT to find the "biggest Chinese Cabbage" and output its difference of two positions.
This problem contains several cases.
Each case is a line of string that only include lowercase letters. (No longer than 1, 000, 000)
For each case, output the difference of two positions of the biggest Chinese Cabbage. If there's no solution, output "TT cries".