



"""simple docstring"""
from itertools import permutations





def  lowerCamelCase_						(UpperCamelCase__		:		tuple							):
    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(UpperCamelCase__							):
        if (num[i + 4] * 100 + num[i + 5] * 10 + num[i + 6]) % test != 0:
            return False
    return True





def  lowerCamelCase_						(UpperCamelCase__		:		int = 10							):
    return sum(
        int(''''''.join(map(UpperCamelCase__     ,       UpperCamelCase__							)							)							)
        for num in permutations(range(UpperCamelCase__							)							)
        if is_substring_divisible(UpperCamelCase__							)							)


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







"""simple docstring"""
def  lowerCamelCase_						(UpperCamelCase__		:		int     ,       UpperCamelCase__		:		int							):
    if a < 0 or b < 0:
        raise ValueError('''the value of both inputs must be positive'''							)
    _UpperCAmelCase							:  List[str]											=    str(bin(UpperCamelCase__							)							)[2:]  # remove the leading "0b"
    _UpperCAmelCase							:  str											=    str(bin(UpperCamelCase__							)							)[2:]
    _UpperCAmelCase							:  List[str]											=    max(len(UpperCamelCase__							)     ,       len(UpperCamelCase__							)							)
    return "0b" + "".join(
        str(int('''1''' in (char_a, char_b)							)							)
        for char_a, char_b in zip(a_binary.zfill(UpperCamelCase__							)     ,       b_binary.zfill(UpperCamelCase__							)							)							)


if __name__ == "__main__":
  import doctest

  doctest.testmod()


