






'''simple docstring'''

from itertools import permutations



def 				snake_case       (  a_				:			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

      UpperCamelCase_					: Optional[Any]            =				[7, 11, 13, 17]
      for i, test in enumerate(a_						):
            if (num[i + 4] * 100 + num[i + 5] * 10 + num[i + 6]) % test != 0:
                  return False
      return True



def 				snake_case       (  a_				:			int = 10						)							->					int:





      """simple docstring"""

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


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














'''simple docstring'''

def 				snake_case       (  a_				:			list[int]     , a_				:			list[int]						)							->					tuple[float, float]:





      """simple docstring"""

      if not len(a_						) == len(a_						) == 3:
            raise ValueError("""Please enter a valid equation."""						)
      if equationa[0] == equationa[1] == equationa[0] == equationa[1] == 0:
            raise ValueError("""Both a & b of two equations can't be zero."""						)

      # Extract the coefficients
      UpperCamelCase_     ,      UpperCamelCase_     ,      UpperCamelCase_					: Optional[int]            =				equationa
      UpperCamelCase_     ,      UpperCamelCase_     ,      UpperCamelCase_					: List[str]            =				equationa

      # Calculate the determinants of the matrices
      UpperCamelCase_					: Union[str, Any]            =				aa * ba - aa * ba
      UpperCamelCase_					: Dict            =				ca * ba - ca * ba
      UpperCamelCase_					: Dict            =				aa * ca - aa * ca

      # Check if the system of linear equations has a solution (using Cramer's rule)
      if determinant == 0:
            if determinant_x == determinant_y == 0:
                  raise ValueError("""Infinite solutions. (Consistent system)"""						)
            else:
                  raise ValueError("""No solution. (Inconsistent system)"""						)
      else:
            if determinant_x == determinant_y == 0:
                  # Trivial solution (Inconsistent system)
                  return (0.0, 0.0)
            else:
                  UpperCamelCase_					: List[Any]            =				determinant_x / determinant
                  UpperCamelCase_					: List[str]            =				determinant_y / determinant
                  # Non-Trivial Solution (Consistent system)
                  return (x, y)






