
"""simple docstring"""





def 	__a     (		__lowerCamelCase = 100_0000  ):
   UpperCAmelCase_					:					int			     =    1
   UpperCAmelCase_					:					Tuple			     =    1
   UpperCAmelCase_					:					Any			     =    {1: 1}

   for inputa in range(2,		__lowerCamelCase  ):
      UpperCAmelCase_					:					Any			     =    0
      UpperCAmelCase_					:					List[Any]			     =    inputa

      while True:
         if number in counters:
            counter += counters[number]
            break
         if number % 2 == 0:
            number //= 2
            counter += 1
         else:
            UpperCAmelCase_					:					Union[str, Any]			     =    (3 * number) + 1
            counter += 1

      if inputa not in counters:
         UpperCAmelCase_					:					str			     =    counter

      if counter > pre_counter:
         UpperCAmelCase_					:					str			     =    inputa
         UpperCAmelCase_					:					str			     =    counter
   return largest_number


if __name__ == "__main__":
    print(solution(int(input().strip())))




"""simple docstring"""





from ...utils import is_torch_available, is_transformers_available


if is_transformers_available() and is_torch_available():
    from .pipeline_vq_diffusion import LearnedClassifierFreeSamplingEmbeddings, VQDiffusionPipeline


