
def 						_snake_case(  SCREAMING_SNAKE_CASE__ = 1_000_000				) ->    int:
       lowercase							:     Optional[Any]       	=      1
       lowercase							:     List[Any]       	=      1
       lowercase							:     Any       	=      {1: 1}

       for inputa in range(2					,	SCREAMING_SNAKE_CASE__				):
              lowercase							:     Any       	=      0
              lowercase							:     int       	=      inputa

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

              if inputa not in counters:
                     lowercase							:     Union[str, Any]       	=      counter

              if counter > pre_counter:
                     lowercase							:     List[Any]       	=      inputa
                     lowercase							:     str       	=      counter
       return largest_number


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


from collections import defaultdict

from graphs.minimum_spanning_tree_prims import prisms_algorithm as mst





def 			lowerCamelCase_ (				):
				lowerCamelCase_	,    lowerCamelCase_						=			9, 1_4  # noqa: F841
				lowerCamelCase_						=			[
				    [0, 1, 4],
				    [0, 7, 8],
				    [1, 2, 8],
				    [7, 8, 7],
				    [7, 6, 1],
				    [2, 8, 2],
				    [8, 6, 6],
				    [2, 3, 7],
				    [2, 5, 4],
				    [6, 5, 2],
				    [3, 5, 1_4],
				    [3, 4, 9],
				    [5, 4, 1_0],
				    [1, 7, 1_1],
				]

				lowerCamelCase_						=			defaultdict(lowerCamelCase__    )
				for nodea, nodea, cost in edges:
								adjancency[nodea].append([nodea, cost]    )
								adjancency[nodea].append([nodea, cost]    )

				lowerCamelCase_						=			mst(lowerCamelCase__    )

				lowerCamelCase_						=			[
				    [7, 6, 1],
				    [2, 8, 2],
				    [6, 5, 2],
				    [0, 1, 4],
				    [2, 5, 4],
				    [2, 3, 7],
				    [0, 7, 8],
				    [3, 4, 9],
				]

				for answer in expected:
								lowerCamelCase_						=			tuple(answer[:2]    )
								lowerCamelCase_						=			tuple(edge[::-1]    )
								assert edge in result or reverse in result


