




def        __UpperCAmelCase						(							lowerCamelCase_ :     int = 1_00_00_00  )       ->  int:







			"""simple docstring"""





			SCREAMING_SNAKE_CASE_   : List[Any]					  =      1
			SCREAMING_SNAKE_CASE_   : str					  =      1
			SCREAMING_SNAKE_CASE_   : Tuple					  =      {1: 1}

			for inputa in range(2  ,							lowerCamelCase_  ):
						SCREAMING_SNAKE_CASE_   : Union[str, Any]					  =      0
						SCREAMING_SNAKE_CASE_   : List[Any]					  =      inputa

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

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

						if counter > pre_counter:
									SCREAMING_SNAKE_CASE_   : int					  =      inputa
									SCREAMING_SNAKE_CASE_   : Tuple					  =      counter
			return largest_number


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









def        __UpperCAmelCase						(							lowerCamelCase_ :     List[str]  ,							lowerCamelCase_ :     Optional[Any]  )       ->  int:







			"""simple docstring"""





			SCREAMING_SNAKE_CASE_   : List[Any]					  =      [0 for i in range(r + 1  )]
			# nc0 = 1
			SCREAMING_SNAKE_CASE_   : Dict					  =      1
			for i in range(1  ,							n + 1  ):
						# to compute current row from previous row.
						SCREAMING_SNAKE_CASE_   : Optional[int]					  =      min(lowerCamelCase_  ,							lowerCamelCase_  )
						while j > 0:
									c[j] += c[j - 1]
									j -= 1
			return c[r]




print(binomial_coefficient(n=10, r=5))



