



"""simple docstring"""







import sys
import turtle






def     _a (	UpperCAmelCase__     ,	UpperCAmelCase__     )						->    Tuple:
      return (pa[0] + pa[0]) / 2, (pa[1] + pa[1]) / 2






def     _a (	UpperCAmelCase__     ,	UpperCAmelCase__     ,	UpperCAmelCase__     ,	UpperCAmelCase__     ,	)						->    int:
      my_pen.up()
      my_pen.goto(vertexa[0]     ,	vertexa[1]     )
      my_pen.down()
      my_pen.goto(vertexa[0]     ,	vertexa[1]     )
      my_pen.goto(vertexa[0]     ,	vertexa[1]     )
      my_pen.goto(vertexa[0]     ,	vertexa[1]     )

      if depth == 0:
            return

      triangle(lowerCamelCase__     ,	get_mid(lowerCamelCase__     ,	lowerCamelCase__     )     ,	get_mid(lowerCamelCase__     ,	lowerCamelCase__     )     ,	depth - 1     )
      triangle(lowerCamelCase__     ,	get_mid(lowerCamelCase__     ,	lowerCamelCase__     )     ,	get_mid(lowerCamelCase__     ,	lowerCamelCase__     )     ,	depth - 1     )
      triangle(lowerCamelCase__     ,	get_mid(lowerCamelCase__     ,	lowerCamelCase__     )     ,	get_mid(lowerCamelCase__     ,	lowerCamelCase__     )     ,	depth - 1     )


if __name__ == "__main__":
       if len(sys.argv) != 2:
              raise ValueError(
                  "Correct format for using this script: "
                  "python fractals.py <int:depth_for_fractal>"
              )
       lowerCAmelCase__									=turtle.Turtle()
       my_pen.ht()
       my_pen.speed(5)
       my_pen.pencolor("red")

       lowerCAmelCase__									=[(-175, -125), (0, 175), (175, -125)]  # vertices of triangle
       triangle(vertices[0], vertices[1], vertices[2], int(sys.argv[1]))

"""simple docstring"""




from itertools import permutations







def 				_UpperCAmelCase		(							lowerCamelCase__  ):





		"""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

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







def 				_UpperCAmelCase		(							lowerCamelCase__ = 10  ):





		"""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() = }")




