
"""simple docstring"""
def 					a__ ( a :					int							,  a :					Any		):

  """simple docstring"""







  if n == 0:
    return 1

  elif n % 2 == 1:
    return binary_exponentiation(a							,  n - 1		) * a

  else:
    _snake_case  :    List[str]            = binary_exponentiation(a							,  n / 2		)
    return b * b


if __name__ == "__main__":
    try:
        _a   :      Optional[int]       =				int(input("""Enter Base : """).strip())
        _a   :      int       =				int(input("""Enter Power : """).strip())
    except ValueError:
        print("""Invalid literal for integer""")

    _a   :      List[Any]       =				binary_exponentiation(BASE, POWER)
    print(f'{BASE}^({POWER}) : {RESULT}')





def 			__SCREAMING_SNAKE_CASE		(		UpperCamelCase		:      int     ,					UpperCamelCase		:      list[tuple[int, int, int]]	)     ->	list[tuple[int, int, int]]:



	"""simple docstring"""






	a_     			=   sorted(UpperCamelCase     ,					key=lambda UpperCamelCase	: edge[2]	)

	a_     			=   list(range(UpperCamelCase	)	)

	def find_parent(UpperCamelCase		:      Any	):
		if i != parent[i]:
			a_     			=   find_parent(parent[i]	)
		return parent[i]

	a_     			=   0
	a_     			=   []

	for edge in edges:
		a_     			=   find_parent(edge[0]	)
		a_     			=   find_parent(edge[1]	)
		if parent_a != parent_b:
			minimum_spanning_tree_cost += edge[2]
			minimum_spanning_tree.append(UpperCamelCase	)
			a_     			=   parent_b

	return minimum_spanning_tree


if __name__ == "__main__":  # pragma: no cover
			_A     ,				_A							     =       list(map(int, input().strip().split()))
			_A							     =       []

			for _ in range(num_edges):
						_A     ,				_A     ,				_A							     =       (int(x) for x in input().strip().split())
						edges.append((nodea, nodea, cost))

			kruskal(num_nodes, edges)