




'''simple docstring'''







from functools import lru_cache






@lru_cache
def 		_lowercase		(	lowercase_  ):



		'''simple docstring'''







		if not isinstance(lowercase_						,							lowercase_  ):
				raise TypeError("k must be an integer."  )
		if k < 0:
				raise ValueError("k integer must be greater or equal to zero."  )
		if k == 0:
				return 0
		elif k == 1:
				return 1
		else:
				return fibonacci(k - 1  ) + fibonacci(k - 2  )






def 		_lowercase		(	lowercase_						,							lowercase_  ):



		'''simple docstring'''







		_snake_case	       =       len(lowercase_  )
		# Find m such that F_m >= n where F_i is the i_th fibonacci number.
		_snake_case	       =       0
		while True:
				if fibonacci(lowercase_  ) >= len_list:
						_snake_case	       =       i
						break
				i += 1
		_snake_case	       =       0
		while fibb_k > 0:
				_snake_case	       =       min(
				    offset + fibonacci(fibb_k - 1  )						,							len_list - 1  )  # Prevent out of range
				_snake_case	       =       arr[index_k]
				if item_k_1 == val:
						return index_k
				elif val < item_k_1:
						fibb_k -= 1
				elif val > item_k_1:
						offset += fibonacci(fibb_k - 1  )
						fibb_k -= 2
		else:
				return -1


if __name__ == "__main__":
						import doctest

						doctest.testmod()







"""simple docstring"""

from math import floor, sqrt




def 			lowercase__  (    lowerCAmelCase :    int       )       ->					int:






    """simple docstring"""




    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 			lowercase__  (    lowerCAmelCase :    int = 10_000       )       ->					int:






    """simple docstring"""




    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()))}')



