



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



def      a__	(						UpperCAmelCase				:     list     )    ->		list:
  UpperCAmelCase			:				Tuple										=					len(UpperCAmelCase     )

  # Set the gap value to be decreased by a factor of 1.3
  # after each iteration
  UpperCAmelCase			:				Optional[Any]										=					1.3

  # Continue sorting until the gap is 1
  while gap > 1:
    # Decrease the gap value
    UpperCAmelCase			:				int										=					int(gap / shrink     )

    # Sort the elements using insertion sort
    for i in range(UpperCAmelCase							,					len(UpperCAmelCase     )     ):
      UpperCAmelCase			:				Union[str, Any]										=					collection[i]
      UpperCAmelCase			:				List[Any]										=					i
      while j >= gap and collection[j - gap] > temp:
        UpperCAmelCase			:				int										=					collection[j - gap]
        j -= gap
      UpperCAmelCase			:				List[Any]										=					temp

  return collection


if __name__ == "__main__":
     import doctest

     doctest.testmod()





