'''simple docstring'''
from math import floor, sqrt







def 			_UpperCamelCase			(  _a						:						int      ):




    """simple docstring"""



    __UpperCamelCase						:						Any		     =	0.0
    __UpperCamelCase						:						List[str]		     =	1.0
    __UpperCamelCase						:						Dict		     =	int(sqrt(_A      )      )
    __UpperCamelCase						:						str		     =	root
    __UpperCamelCase						:						Tuple		     =	0
    while integer_part != 2 * root:
        __UpperCamelCase						:						List[Any]		     =	denominator * integer_part - numerator
        __UpperCamelCase						:						Optional[int]		     =	(n - numerator**2) / denominator
        __UpperCamelCase						:						Dict		     =	int((root + numerator) / denominator      )
        period += 1
    return period







def 			_UpperCamelCase			(  _a						:						int = 1_0_0_0_0      ):




    """simple docstring"""



    __UpperCamelCase						:						Dict		     =	0
    for i in range(2					,  n + 1      ):
        __UpperCamelCase						:						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




def        __UpperCamelCase     (      _A					:							int      ,  _A					:							list[int]      ,  _A					:							list[int]      ,  _A					:							int		)				->int:



							"""simple docstring"""

							# Base Case
							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(_A      ,  _A      ,  _A      ,  counter - 1		)
							else:
														lowerCamelCase_								=capacity - weights[counter - 1]
														lowerCamelCase_								=values[counter - 1] + knapsack(
														    _A      ,  _A      ,  _A      ,  counter - 1		)
														lowerCamelCase_								=knapsack(_A      ,  _A      ,  _A      ,  counter - 1		)
														return max(_A      ,  _A		)


if __name__ == "__main__":
	import doctest

	doctest.testmod()
