


"""simple docstring"""







from math import ceil, sqrt





def 					lowercase      (    A_ = 1_000_000	)->				int:
  '''simple docstring'''







  a						:		Tuple											=      0

  for outer_width in range(3  ,       (limit // 4) + 2	):
    if outer_width**2 > limit:
      a						:		str											=      max(ceil(sqrt(outer_width**2 - limit	)	)  ,       1	)
    else:
      a						:		Tuple											=      1
    if (outer_width - hole_width_lower_bound) % 2:
      hole_width_lower_bound += 1

    answer += (outer_width - hole_width_lower_bound - 2) // 2 + 1

  return answer


if __name__ == "__main__":
 print(f'''{solution() = }''')










"""simple docstring"""







from __future__ import annotations






class 						_A  :







    """simple docstring"""




    def __init__( self    :   Tuple    ,			__UpperCAmelCase    :   List[Any]=None):
      a						:		int											=      data
      a						:		Dict											=      None






    def __repr__( self    :   Dict):
      a						:		List[Any]											=      []
      a						:		str											=      self
      while temp:
        string_rep.append(f'''{temp.data}''')
        a						:		Tuple											=      temp.next
      return "->".join(__UpperCAmelCase)






def 					lowercase      (    A_	)->				Any:
  '''simple docstring'''







  if not elements_list:
    raise Exception("The Elements List is empty"	)

  a						:		Any											=      Node(elements_list[0]	)
  for i in range(1  ,       len(A_	)	):
    a						:		int											=      Node(elements_list[i]	)
    a						:		Optional[Any]											=      current.next
  return head


def 					lowercase      (    A_	)->				None:
  '''simple docstring'''







  if head_node is not None and isinstance(A_  ,       A_	):
    print_reverse(head_node.next	)
    print(head_node.data	)


def 					lowercase      (    )->				List[Any]:
  '''simple docstring'''







  from doctest import testmod

  testmod()

  a						:		Union[str, Any]											=      make_linked_list([14, 52, 14, 12, 43]	)
  print("Linked List:"	)
  print(A_	)
  print("Elements in Reverse:"	)
  print_reverse(A_	)


if __name__ == "__main__":
 main()






