
'''simple docstring'''

import requests
from bsa import BeautifulSoup







def 					A       ( UpperCamelCase_   :       int  ,		UpperCamelCase_   :       str )   ->    str:







			'''simple docstring'''



			lowerCAmelCase__									=							(
			    "https://www.horoscope.com/us/horoscopes/general/"
			    F"""horoscope-general-daily-{day}.aspx?sign={zodiac_sign}"""
			)
			lowerCAmelCase__									=							BeautifulSoup(requests.get(SCREAMING_SNAKE_CASE_ ).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",
		)
		UpperCAmelCase__				:	Dict					=						int(input("number> ").strip())
		print("choose some day:\n", "yesterday\n", "today\n", "tomorrow\n")
		UpperCAmelCase__				:	Union[str, Any]					=						input("enter the day> ")
		UpperCAmelCase__				:	Optional[Any]					=						horoscope(zodiac_sign, day)
		print(horoscope_text)








'''simple docstring'''

import math







def 					A       ( UpperCamelCase_   :       int )   ->    list:







			'''simple docstring'''



			if n <= 0:
						raise ValueError("Only positive integers have prime factors" )
			lowerCAmelCase__									=							[]
			while n % 2 == 0:
						pf.append(2 )
						lowerCAmelCase__									=							int(n / 2 )
			for i in range(3  ,		int(math.sqrt(UpperCamelCase_ ) ) + 1  ,		2 ):
						while n % i == 0:
									pf.append(UpperCamelCase_ )
									lowerCAmelCase__									=							int(n / i )
			if n > 2:
						pf.append(UpperCamelCase_ )
			return pf







def 					A       ( UpperCamelCase_   :       int )   ->    int:







			'''simple docstring'''



			if n <= 0:
						raise ValueError("Only positive numbers are accepted" )
			lowerCAmelCase__									=							1
			lowerCAmelCase__									=							1
			while n % 2 == 0:
						temp += 1
						lowerCAmelCase__									=							int(n / 2 )
			div *= temp
			for i in range(3  ,		int(math.sqrt(UpperCamelCase_ ) ) + 1  ,		2 ):
						lowerCAmelCase__									=							1
						while n % i == 0:
									temp += 1
									lowerCAmelCase__									=							int(n / i )
						div *= temp
			if n > 1:
						div *= 2
			return div







def 					A       ( UpperCamelCase_   :       int )   ->    int:







			'''simple docstring'''



			if n <= 0:
						raise ValueError("Only positive numbers are accepted" )
			lowerCAmelCase__									=							1
			lowerCAmelCase__									=							1
			while n % 2 == 0:
						temp += 1
						lowerCAmelCase__									=							int(n / 2 )
			if temp > 1:
						s *= (2**temp - 1) / (2 - 1)
			for i in range(3  ,		int(math.sqrt(UpperCamelCase_ ) ) + 1  ,		2 ):
						lowerCAmelCase__									=							1
						while n % i == 0:
									temp += 1
									lowerCAmelCase__									=							int(n / i )
						if temp > 1:
									s *= (i**temp - 1) / (i - 1)
			return int(UpperCamelCase_ )







def 					A       ( UpperCamelCase_   :       int )   ->    int:







			'''simple docstring'''



			lowerCAmelCase__									=							n
			for x in set(prime_factors(UpperCamelCase_ ) ):
						s *= (x - 1) / x
			return int(UpperCamelCase_ )


if __name__ == "__main__":
		import doctest

		doctest.testmod()





