





from .hash_table import HashTable
from .number_theory.prime_numbers import is_prime, next_prime

class 			A_ (a_    ):
	def __init__(					self							,      *_A							,      **_A	):






				'''simple docstring'''







				super().__init__(*_A							,      **_A	)
	def   _lowercase       (					self							,      _A							,      _A	):






				'''simple docstring'''







				UpperCAmelCase     	=       (
				    next_prime(value % self.size_table	)
				    if not is_prime(value % self.size_table	)
				    else value % self.size_table
				)  # gt = bigger than
				return next_prime_gt - (data % next_prime_gt)
	def   _lowercase       (					self							,      _A							,      _A							,      _A	):






				'''simple docstring'''







				return (increment * self.__hash_function_a(_A							,      _A	)) % self.size_table







	def   _lowercase       (					self							,      _A							,      _A=None	):






				'''simple docstring'''







				UpperCAmelCase     	=       1
				UpperCAmelCase     	=       self.hash_function(_A	)

				while self.values[new_key] is not None and self.values[new_key] != key:
							UpperCAmelCase     	=       (
							    self.__hash_double_function(_A							,      _A							,      _A	)
							    if self.balanced_factor() >= self.lim_charge
							    else None
							)
							if new_key is None:
										break
							else:
										i += 1

				return new_key










from math import floor, sqrt





def 		__SCREAMING_SNAKE_CASE						(       UpperCamelCase__				)						->       int:







			'''simple docstring'''

			UpperCAmelCase     	=       0.0
			UpperCAmelCase     	=       1.0
			UpperCAmelCase     	=       int(sqrt(UpperCamelCase__				)				)
			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 		__SCREAMING_SNAKE_CASE						(       UpperCamelCase__ = 1_0000				)						->       int:







			'''simple docstring'''

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


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



