code: 
  
  
  from math import floor, sqrt
  
  
  
  
  def       a__						(		snake_case__				:       int    ):
    _UpperCAmelCase		:       Any       =    0.0
    _UpperCAmelCase		:       Union[str, Any]       =    1.0
    _UpperCAmelCase		:       Union[str, Any]       =    int(sqrt(snake_case__    )    )
    _UpperCAmelCase		:       List[Any]       =    root
    _UpperCAmelCase		:       str       =    0
    while integer_part != 2 * root:
      _UpperCAmelCase		:       List[str]       =    denominator * integer_part - numerator
      _UpperCAmelCase		:       Optional[Any]       =    (n - numerator**2) / denominator
      _UpperCAmelCase		:       Dict       =    int((root + numerator) / denominator    )
      period += 1
    return period
  
  
  
  
  def       a__						(		snake_case__				:       int = 1_0000    ):
    _UpperCAmelCase		:       str       =    0
    for i in range(2	,      n + 1    ):
      _UpperCAmelCase		:       Dict       =    sqrt(snake_case__    )
      if sr - floor(snake_case__    ) != 0 and continuous_fraction_period(snake_case__    ) % 2 == 1:
        count_odd_periods += 1
    return count_odd_periods
  
  
  if __name__ == "__main__":
   print(F'{solution(int(input().strip()))}')
  
  
  
  
  
  
style_context: 
  
  
  from itertools import count
  from math import asin, pi, sqrt
  
  
  
  
  def       a__						(		snake_case__				:       float    ):
    return (
        (1 - 2 * point) * sqrt(point - point**2    ) + 2 * point + asin(sqrt(1 - point    )    )
    ) / 4
  
  
  
  
  def       a__						(		snake_case__				:       int    ):
    _UpperCAmelCase		:       int       =    (circles_number + 1 - sqrt(2 * circles_number    )) / (
        2 * (circles_number**2 + 1)
    )
    _UpperCAmelCase		:       Union[str, Any]       =    circles_number * intersection_y
  
    _UpperCAmelCase		:       Tuple       =    intersection_x * intersection_y / 2
    _UpperCAmelCase		:       str       =    circle_bottom_arc_integral(
        1 / 2    ) - circle_bottom_arc_integral(snake_case__    )
  
    return triangle_area + concave_region_area
  
  
  
  
  def       a__						(		snake_case__				:       float = 1 / 1000    ):
    _UpperCAmelCase		:       Dict       =    (1 - pi / 4) / 4
  
    for n in count(1    ):
      if concave_triangle_area(snake_case__    ) / l_section_area < fraction:
        return n
  
    return -1
  
  
  if __name__ == "__main__":
   print(F'{solution() = }')
  
  
  
  
  
  