





import sys
import turtle

def     __A      (			a_						:Tuple   ,       a_						:str)		->		List[str]:
				return (pa[0] + pa[0]) / 2, (pa[1] + pa[1]) / 2

def     __A      (			a_						:List[Any]   ,       a_						:str   ,       a_						:List[Any]   ,       a_						:Any   ,       )		->		Union[str, Any]:
				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(_lowercase   ,       get_mid(_lowercase   ,       _lowercase)   ,       get_mid(_lowercase   ,       _lowercase)   ,       depth - 1)
				triangle(_lowercase   ,       get_mid(_lowercase   ,       _lowercase)   ,       get_mid(_lowercase   ,       _lowercase)   ,       depth - 1)
				triangle(_lowercase   ,       get_mid(_lowercase   ,       _lowercase)   ,       get_mid(_lowercase   ,       _lowercase)   ,       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>'''
				)
		A 			=  turtle.Turtle()
		my_pen.ht()
		my_pen.speed(5)
		my_pen.pencolor('''red''')

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






"""simple docstring"""






from __future__ import annotations

from collections import deque
from collections.abc import Iterator
from dataclasses import dataclass




@dataclass
class 				__lowercase			:







					'''simple docstring'''




					__lowerCAmelCase  =  42
					__lowerCAmelCase  =  42






class 				__lowercase			:







					'''simple docstring'''




					def __init__(						self	,			_UpperCAmelCase     ):
									__a :						list[list[Edge]]			       =  [[] for _ in range(_UpperCAmelCase     )]
									__a :						Dict			       =  size







					def __getitem__(						self	,			_UpperCAmelCase     ):
									return iter(self._graph[vertex]     )







					@property
					def  _lowerCamelCase		(						self     ):
									return self._size







					def  _lowerCamelCase		(						self	,			_UpperCAmelCase	,			_UpperCAmelCase	,			_UpperCAmelCase     ):
									if weight not in (0, 1):
													raise ValueError('''Edge weight must be either 0 or 1.'''     )

									if to_vertex < 0 or to_vertex >= self.size:
													raise ValueError('''Vertex indexes must be in [0; size).'''     )

									self._graph[from_vertex].append(Edge(_UpperCAmelCase	,			_UpperCAmelCase     )     )







					def  _lowerCamelCase		(						self	,			_UpperCAmelCase	,			_UpperCAmelCase     ):
									__a :						List[str]			       =  deque([start_vertex]     )
									__a :						list[int | None]			       =  [None] * self.size
									__a :						int			       =  0

									while queue:
													__a :						Any			       =  queue.popleft()
													__a :						Tuple			       =  distances[current_vertex]
													if current_distance is None:
																	continue

													for edge in self[current_vertex]:
																	__a :						List[str]			       =  current_distance + edge.weight
																	__a :						str			       =  distances[edge.destination_vertex]
																	if (
																	    isinstance(_UpperCAmelCase	,			_UpperCAmelCase     )
																	    and new_distance >= dest_vertex_distance
																	):
																					continue
																	__a :						str			       =  new_distance
																	if edge.weight == 0:
																					queue.appendleft(edge.destination_vertex     )
																	else:
																					queue.append(edge.destination_vertex     )

									if distances[finish_vertex] is None:
													raise ValueError('''No path from start_vertex to finish_vertex.'''     )

									return distances[finish_vertex]


if __name__ == "__main__":
		import doctest

		doctest.testmod()