





from itertools import permutations



def _a				(	lowerCamelCase:   tuple )	->						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

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



def _a				(	lowerCamelCase:   int = 10 )	->						int:







      '''simple docstring'''






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


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












from __future__ import annotations

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

snake_case__					:							Union[str, Any]													=     (3, 9, -11, 0, 7, 5, 1, -1)
snake_case__					:							int													=     (4, 6, 2, 0, 8, 10, 3, -2)





@dataclass
class A_					:
   lowerCAmelCase__        = 42
   lowerCAmelCase__        = 42





class A_					:




   def __init__(self	:Dict    ,   _UpperCamelCase	:Iterable[int] )->					None:
         __A          =				None
         for i in sorted(_UpperCamelCase    ,   reverse=_UpperCamelCase ):
               __A          =				Node(_UpperCamelCase    ,   self.head )




   def __iter__(self	:List[str] )->					Iterator[int]:
         __A          =				self.head
         while node:
               yield node.data
               __A          =				node.next_node




   def __len__(self	:Union[str, Any] )->					int:
         return sum(1 for _ in self )






   def __str__(self	:List[Any] )->					str:
         return " -> ".join([str(_UpperCamelCase ) for node in self] )





def _a				(	lowerCamelCase:   SortedLinkedList					,				lowerCamelCase:   SortedLinkedList )	->						SortedLinkedList:







      '''simple docstring'''






      return SortedLinkedList(list(lowerCamelCase ) + list(lowerCamelCase ) )


if __name__ == "__main__":
       import doctest

       doctest.testmod()
       snake_case__					:							Any													=     SortedLinkedList
       print(merge_lists(SSL(test_data_odd), SSL(test_data_even)))





