






def       __lowerCAmelCase      (						__snake_case = 100_0000       ):
     __lowerCAmelCase								=					1
     __lowerCAmelCase								=					1
     __lowerCAmelCase								=					{1: 1}

     for inputa in range(2					, __snake_case       ):
          __lowerCAmelCase								=					0
          __lowerCAmelCase								=					inputa

          while True:
               if number in counters:
                    counter += counters[number]
                    break
               if number % 2 == 0:
                    number //= 2
                    counter += 1
               else:
                    __lowerCAmelCase								=					(3 * number) + 1
                    counter += 1

          if inputa not in counters:
               __lowerCAmelCase								=					counter

          if counter > pre_counter:
               __lowerCAmelCase								=					inputa
               __lowerCAmelCase								=					counter
     return largest_number


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














from __future__ import annotations





def       __lowerCAmelCase      (						__snake_case					, __snake_case					, __snake_case       ):
     __lowerCAmelCase								=					list(range(len(__snake_case       )       )       )
     __lowerCAmelCase								=					[v / w for v, w in zip(__snake_case					, __snake_case       )]
     index.sort(key=lambda __snake_case       : ratio[i]					, reverse=__snake_case       )

     __lowerCAmelCase								=					0
     __lowerCAmelCase								=					[0] * len(__snake_case       )
     for i in index:
          if weight[i] <= capacity:
               __lowerCAmelCase								=					1
               max_value += value[i]
               capacity -= weight[i]
          else:
               __lowerCAmelCase								=					capacity / weight[i]
               max_value += value[i] * capacity / weight[i]
               break

     return max_value, fractions


if __name__ == "__main__":
 import doctest

 doctest.testmod()






