
from __future__ import annotations

from collections.abc import Iterable, Iterator
from dataclasses import dataclass

lowercase__             =(3, 9, -11, 0, 7, 5, 1, -1)
lowercase__             =(4, 6, 2, 0, 8, 10, 3, -2)



@dataclass
class 		UpperCamelCase__  :
   _SCREAMING_SNAKE_CASE				:							int
   _SCREAMING_SNAKE_CASE				:							Node | None





class 		UpperCamelCase__  :
   def __init__(self			: Any ,    snake_case_			: Iterable[int]       ):
    __a			:  Node | None		    =  None
    for i in sorted(snake_case_ ,    reverse=snake_case_       ):
     __a			:  Optional[int]		    =  Node(snake_case_ ,    self.head       )
   def __iter__(self			: Union[str, Any]       ):
    __a			:  Tuple		    =  self.head
    while node:
     yield node.data
     __a			:  Union[str, Any]		    =  node.next_node
   def __len__(self			: int       ):
    return sum(1 for _ in self       )







   def __str__(self			: Tuple       ):
    return " -> ".join([str(snake_case_       ) for node in self]       )





def        __UpperCamelCase					(    lowerCAmelCase__							:    SortedLinkedList  ,       lowerCAmelCase__							:    SortedLinkedList  ):
 return SortedLinkedList(list(lowerCAmelCase__  ) + list(lowerCAmelCase__  )  )


if __name__ == "__main__":
      import doctest

      doctest.testmod()
      lowercase__             =SortedLinkedList
      print(merge_lists(SSL(test_data_odd), SSL(test_data_even)))


def        __UpperCamelCase					(    lowerCAmelCase__							:    int = 1_0_0_0  ):
 __a			:  int		    =  -1
 __a			:  Any		    =  0
 for a in range(1  ,       n // 3  ):
  # Solving the two equations a**2+b**2=c**2 and a+b+c=N eliminating c
  __a			:  List[Any]		    =  (n * n - 2 * a * n) // (2 * n - 2 * a)
  __a			:  Union[str, Any]		    =  n - a - b
  if c * c == (a * a + b * b):
   __a			:  Union[str, Any]		    =  a * b * c
   if candidate >= product:
    __a			:  List[Any]		    =  candidate
 return product


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