
from __future__ import annotations


def       UpperCAmelCase__							(    __magic_name__  :       int							,					__magic_name__  :       list[int]							,					__magic_name__  :       list[int]							,					__magic_name__  :       int					):


					'''simple docstring'''

					if counter == 0 or capacity == 0:
										return 0

					# If weight of the nth item is more than Knapsack of capacity,
					#   then this item cannot be included in the optimal solution,
					# else return the maximum of two cases:
					#   (1) nth item included
					#   (2) not included
					if weights[counter - 1] > capacity:
										return knapsack(__magic_name__							,					__magic_name__							,					__magic_name__							,					counter - 1					)
					else:
										lowerCAmelCase						:   Union[str, Any]							=       capacity - weights[counter - 1]
										lowerCAmelCase						:   Any							=       values[counter - 1] + knapsack(
										    __magic_name__							,					__magic_name__							,					__magic_name__							,					counter - 1					)
										lowerCAmelCase						:   str							=       knapsack(__magic_name__							,					__magic_name__							,					__magic_name__							,					counter - 1					)
										return max(__magic_name__							,					__magic_name__					)


if __name__ == "__main__":
		import doctest

		doctest.testmod()


from math import floor, sqrt
def       UpperCAmelCase__							(    __magic_name__  :       int					):


					'''simple docstring'''

					lowerCAmelCase						:   int							=       0.0
					lowerCAmelCase						:   int							=       1.0
					lowerCAmelCase						:   Any							=       int(sqrt(__magic_name__					)					)
					lowerCAmelCase						:   Optional[int]							=       root
					lowerCAmelCase						:   Dict							=       0
					while integer_part != 2 * root:
										lowerCAmelCase						:   str							=       denominator * integer_part - numerator
										lowerCAmelCase						:   Dict							=       (n - numerator**2) / denominator
										lowerCAmelCase						:   str							=       int((root + numerator) / denominator					)
										period += 1
					return period
def       UpperCAmelCase__							(    __magic_name__  :       int = 1_00_00					):


					'''simple docstring'''

					lowerCAmelCase						:   List[str]							=       0
					for i in range(2							,					n + 1					):
										lowerCAmelCase						:   Any							=       sqrt(__magic_name__					)
										if sr - floor(__magic_name__					) != 0 and continuous_fraction_period(__magic_name__					) % 2 == 1:
															count_odd_periods += 1
					return count_odd_periods


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