



from math import floor, sqrt



def  _lowerCAmelCase     (_lowerCAmelCase):
					UpperCamelCase_			= 0.0
					UpperCamelCase_			= 1.0
					UpperCamelCase_			= int(sqrt(_lowerCAmelCase))
					UpperCamelCase_			= root
					UpperCamelCase_			= 0
					while integer_part != 2 * root:
										UpperCamelCase_			= denominator * integer_part - numerator
										UpperCamelCase_			= (n - numerator**2) / denominator
										UpperCamelCase_			= int((root + numerator) / denominator)
										period += 1
					return period



def  _lowerCAmelCase     (_lowerCAmelCase = 1_00_00):
					UpperCamelCase_			= 0
					for i in range(2 ,						n + 1):
										UpperCamelCase_			= sqrt(_lowerCAmelCase)
										if sr - floor(_lowerCAmelCase) != 0 and continuous_fraction_period(_lowerCAmelCase) % 2 == 1:
															count_odd_periods += 1
					return count_odd_periods


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


'''simple docstring'''







def 				_snake_case (		lowercase = 2_0						)       ->       int:

				try:
								__a       :     Optional[Any]								=	int(lowercase						)
				except (TypeError, ValueError):
								raise TypeError("""Parameter n must be int or castable to int."""						)
				if n <= 0:
								raise ValueError("""Parameter n must be greater than or equal to one."""						)
				__a       :     List[Any]								=	0
				while 1:
								i += n * (n - 1)
								__a       :     Union[str, Any]								=	0
								for j in range(2			,    lowercase						):
												if i % j != 0:
																__a       :     Any								=	1
																break
								if nfound == 0:
												if i == 0:
																__a       :     List[str]								=	1
												return i
				return None


if __name__ == "__main__":
					print(f'''{solution() = }''')