





from __future__ import annotations

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

SCREAMING_SNAKE_CASE_						       =	(3, 9, -1_1, 0, 7, 5, 1, -1)
SCREAMING_SNAKE_CASE_						       =	(4, 6, 2, 0, 8, 1_0, 3, -2)

@dataclass
class 		UpperCamelCase__			:



     '''simple docstring'''

     __snake_case   :     int
     __snake_case   :     Node | None

class 		UpperCamelCase__			:



     '''simple docstring'''

     def __init__(							self						:   str						,lowerCamelCase__						:   Iterable[int]	)					->		None:




           '''simple docstring'''


           SCREAMING_SNAKE_CASE		=						None
           for i in sorted(lowerCamelCase__						,reverse=lowerCamelCase__	):
                 SCREAMING_SNAKE_CASE		=						Node(lowerCamelCase__						,self.head	)






     def __iter__(							self						:   int	)					->		Iterator[int]:




           '''simple docstring'''


           SCREAMING_SNAKE_CASE		=						self.head
           while node:
                 yield node.data
                 SCREAMING_SNAKE_CASE		=						node.next_node






     def __len__(							self						:   List[Any]	)					->		int:




           '''simple docstring'''


           return sum(1 for _ in self	)






     def __str__(							self						:   Dict	)					->		str:




           '''simple docstring'''


           return " -> ".join([str(lowerCamelCase__	) for node in self]	)



def        __lowercase       (				_SCREAMING_SNAKE_CASE			,						_SCREAMING_SNAKE_CASE     )			->       SortedLinkedList:


      '''simple docstring'''


      return SortedLinkedList(list(_SCREAMING_SNAKE_CASE     ) + list(_SCREAMING_SNAKE_CASE     )     )


if __name__ == "__main__":
      import doctest

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









from itertools import permutations



def        __lowercase       (				_SCREAMING_SNAKE_CASE     )			->       bool:


      '''simple docstring'''


      if num[3] % 2 != 0:
            return False

      if (num[2] + num[3] + num[4]) % 3 != 0:
            return False

      if num[5] % 5 != 0:
            return False

      SCREAMING_SNAKE_CASE		=						[7, 11, 13, 17]
      for i, test in enumerate(_SCREAMING_SNAKE_CASE     ):
            if (num[i + 4] * 1_00 + num[i + 5] * 10 + num[i + 6]) % test != 0:
                  return False
      return True



def        __lowercase       (				_SCREAMING_SNAKE_CASE = 10     )			->       int:


      '''simple docstring'''


      return sum(
          int("""""".join(map(_SCREAMING_SNAKE_CASE			,						_SCREAMING_SNAKE_CASE     )     )     )
          for num in permutations(range(_SCREAMING_SNAKE_CASE     )     )
          if is_substring_divisible(_SCREAMING_SNAKE_CASE     )     )


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


