




"""simple docstring"""




def 					a__				(       snake_case__ ,				snake_case__       )		->      Dict:
			if b == 0:
						return 1
			if (b % 2) == 0:
						return actual_power(snake_case__ ,				int(b / 2       )       ) * actual_power(snake_case__ ,				int(b / 2       )       )
			else:
						return a * actual_power(snake_case__ ,				int(b / 2       )       ) * actual_power(snake_case__ ,				int(b / 2       )       )



def 					a__				(       snake_case__ ,				snake_case__       )		->      float:
			if b < 0:
						return 1 / actual_power(snake_case__ ,				snake_case__       )
			return actual_power(snake_case__ ,				snake_case__       )


if __name__ == "__main__":
					print(power(-2, -3))









"""simple docstring"""




def 					a__				(       snake_case__ = 1_00_00_00       )		->      int:
			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())))



