






from math import floor, sqrt

def    lowerCAmelCase__		(			_a				:	int			):
		snake_case_ :							Optional[int]         =				0.0
		snake_case_ :							Dict         =				1.0
		snake_case_ :							Union[str, Any]         =				int(sqrt(_a			)			)
		snake_case_ :							Optional[int]         =				root
		snake_case_ :							Dict         =				0
		while integer_part != 2 * root:
				snake_case_ :							Union[str, Any]         =				denominator * integer_part - numerator
				snake_case_ :							List[str]         =				(n - numerator**2) / denominator
				snake_case_ :							List[str]         =				int((root + numerator) / denominator			)
				period += 1
		return period

def    lowerCAmelCase__		(			_a				:	int = 1_00_00			):
		snake_case_ :							Union[str, Any]         =				0
		for i in range(2     ,					n + 1			):
				snake_case_ :							Union[str, Any]         =				sqrt(_a			)
				if sr - floor(_a			) != 0 and continuous_fraction_period(_a			) % 2 == 1:
						count_odd_periods += 1
		return count_odd_periods


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








from __future__ import annotations

from collections.abc import Generator

def    lowerCAmelCase__		(			_a				:	int			):
		if not isinstance(_a     ,					_a			) or n < 1:
				raise Exception("Sequence only defined for positive integers"			)

		yield n
		while n != 1:
				if n % 2 == 0:
						n //= 2
				else:
						snake_case_ :							List[str]         =				3 * n + 1
				yield n

def    lowerCAmelCase__		(			):
		snake_case_ :							Optional[int]         =				43
		snake_case_ :							Union[str, Any]         =				tuple(collatz_sequence(_a			)			)
		print(_a			)
		print(F'''Collatz sequence from {n} took {len(_a			)} steps.'''			)


if __name__ == "__main__":
							main()
