Time Limit: 1s
Memory Limit: 128MB
xi+1= the number of digits in the decimal representation of xi
Your task is to determine the smallest positive i such that xi = xi-1.
Input consists of several lines. Each line contains a value of x0. Every value of x0 is non-negative and has no more than one million digits. The last line of input contains the word END.
For each value of x0 given in the input, output one line containing the smallest positive i such that xi = xi-1.