
"""simple docstring"""







import requests
from bsa import BeautifulSoup
def        __lowerCAmelCase							(_UpperCamelCase			,    _UpperCamelCase						):
	__lowerCAmelCase     :		Optional[Any]		     = (
	    'https://www.horoscope.com/us/horoscopes/general/'
	    F"horoscope-general-daily-{day}.aspx?sign={zodiac_sign}"
	)
	__lowerCAmelCase     :		List[str]		     = BeautifulSoup(requests.get(_UpperCamelCase						).content			,    'html.parser'						)
	return soup.find('div'			,    class_='main-horoscope'						).p.text


if __name__ == "__main__":
							print("""Daily Horoscope. \n""")
							print(
							    """enter your Zodiac sign number:\n""",
							    """1. Aries\n""",
							    """2. Taurus\n""",
							    """3. Gemini\n""",
							    """4. Cancer\n""",
							    """5. Leo\n""",
							    """6. Virgo\n""",
							    """7. Libra\n""",
							    """8. Scorpio\n""",
							    """9. Sagittarius\n""",
							    """10. Capricorn\n""",
							    """11. Aquarius\n""",
							    """12. Pisces\n""",
							)
							lowerCamelCase__     =						int(input("""number> """).strip())
							print("""choose some day:\n""", """yesterday\n""", """today\n""", """tomorrow\n""")
							lowerCamelCase__     =						input("""enter the day> """)
							lowerCamelCase__     =						horoscope(zodiac_sign, day)
							print(horoscope_text)

"""simple docstring"""







def        __lowerCAmelCase							(_UpperCamelCase			,    _UpperCamelCase						):
	__lowerCAmelCase     :		Any		     = sorted(_UpperCamelCase			,    key=lambda _UpperCamelCase						: edge[2]						)

	__lowerCAmelCase     :		Union[str, Any]		     = list(range(_UpperCamelCase						)						)

	def find_parent(_UpperCamelCase						):
		if i != parent[i]:
			__lowerCAmelCase     :		int		     = find_parent(parent[i]						)
		return parent[i]

	__lowerCAmelCase     :		Optional[Any]		     = 0
	__lowerCAmelCase     :		List[str]		     = []

	for edge in edges:
		__lowerCAmelCase     :		List[str]		     = find_parent(edge[0]						)
		__lowerCAmelCase     :		Optional[Any]		     = find_parent(edge[1]						)
		if parent_a != parent_b:
			minimum_spanning_tree_cost += edge[2]
			minimum_spanning_tree.append(_UpperCamelCase						)
			__lowerCAmelCase     :		Optional[Any]		     = parent_b

	return minimum_spanning_tree


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

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

							kruskal(num_nodes, edges)