### cycle length of n

consider the following algorithm :
if

else Given the input 22, the following sequence of numbers will be printed 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1 It is conjectured that the algorithm above will terminate (when a 1 is printed) for any integral input value. Given an input

*n*= 1 then STOP if*n*is odd thenelse Given the input 22, the following sequence of numbers will be printed 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1 It is conjectured that the algorithm above will terminate (when a 1 is printed) for any integral input value. Given an input

*n*, it is possible to determine the number of numbers printed (including the 1). For a given*n*this is called the*cycle-length*of*n*. In the example above, the cycle length of 22 is 16. For any two numbers*i*and*j*you are to determine the maximum cycle length over all numbers between*i*and*j*. Sample Input (1<n<1000000) 1 10 100 200 201 210 900 1000 Sample Output 1 10 20 100 200 125 201 210 89 900 1000 174