
"""simple docstring"""



from itertools import permutations
def 					lowerCamelCase   (     _snake_case ):
    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

    UpperCAmelCase__	:      List[str]     							=					[7, 11, 13, 17]
    for i, test in enumerate(_snake_case ):
        if (num[i + 4] * 100 + num[i + 5] * 10 + num[i + 6]) % test != 0:
            return False
    return True
def 					lowerCamelCase   (     _snake_case = 10 ):
    return sum(
        int(''.join(map(_snake_case    ,_snake_case ) ) )
        for num in permutations(range(_snake_case ) )
        if is_substring_divisible(_snake_case ) )


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



"""simple docstring"""



from __future__ import annotations

from collections.abc import Iterator





class 				a			:



      def __init__(   self     ,	UpperCamelCase_      ):
          UpperCAmelCase__	:      str     							=					value
          UpperCAmelCase__	:      Node | None     							=					None
          UpperCAmelCase__	:      Node | None     							=					None





class 				a			:



      def __init__(   self     ,	UpperCamelCase_      ):
          UpperCAmelCase__	:      str     							=					tree



      def  __snake_case							(   self     ,	UpperCamelCase_      ):
          if node is None:
              return 0
          return node.value + (
              self.depth_first_search(node.left      ) + self.depth_first_search(node.right      )
          )



      def __iter__(   self      ):
          yield self.depth_first_search(self.tree      )


if __name__ == "__main__":
    import doctest

    doctest.testmod()

