
'''simple docstring'''


import requests
from bsa import BeautifulSoup
def 					__magic_name__(       UpperCAmelCase__ :       int							,				UpperCAmelCase__ :       str	):
						UpperCamelCase_     :	List[Any]					     =     (
						    """https://www.horoscope.com/us/horoscopes/general/"""
						    f"""horoscope-general-daily-{day}.aspx?sign={zodiac_sign}"""
						)
						UpperCamelCase_     :	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",
	)
	__SCREAMING_SNAKE_CASE						=      int(input("number> ").strip())
	print("choose some day:\n", "yesterday\n", "today\n", "tomorrow\n")
	__SCREAMING_SNAKE_CASE						=      input("enter the day> ")
	__SCREAMING_SNAKE_CASE						=      horoscope(zodiac_sign, day)
	print(horoscope_text)






'''simple docstring'''


import math
from collections.abc import Generator
def 					__magic_name__(       UpperCAmelCase__ :       int	):
						UpperCamelCase_     :	Generator					     =     (i for i in range(1							,				(max_n + 1)	))
						for i in (n for n in numbers if n > 1):
												for j in range(2							,				UpperCAmelCase__	):
																		if (i % j) == 0:
																								break
												else:
																		yield i
def 					__magic_name__(       UpperCAmelCase__ :       int	):
						UpperCamelCase_     :	Generator					     =     (i for i in range(1							,				(max_n + 1)	))
						for i in (n for n in numbers if n > 1):
												# only need to check for factors up to sqrt(i)
												UpperCamelCase_     :	List[Any]					     =     int(math.sqrt(UpperCAmelCase__	)	) + 1
												for j in range(2							,				UpperCAmelCase__	):
																		if (i % j) == 0:
																								break
												else:
																		yield i
def 					__magic_name__(       UpperCAmelCase__ :       int	):
						UpperCamelCase_     :	Generator					     =     (i for i in range(1							,				(max_n + 1)							,				2	))
						# It's useless to test even numbers as they will not be prime
						if max_n > 2:
												yield 2  # Because 2 will not be tested, it's necessary to yield it now
						for i in (n for n in numbers if n > 1):
												UpperCamelCase_     :	Optional[int]					     =     int(math.sqrt(UpperCAmelCase__	)	) + 1
												for j in range(3							,				UpperCAmelCase__							,				2	):
																		# As we removed the even numbers, we don't need them now
																		if (i % j) == 0:
																								break
												else:
																		yield i
def 					__magic_name__(       ):
						from timeit import timeit

						UpperCamelCase_     :	int					     =     """from __main__ import slow_primes, primes, fast_primes"""
						print(timeit("""slow_primes(1_000_000_000_000)"""							,				setup=UpperCAmelCase__							,				number=1000000	)	)
						print(timeit("""primes(1_000_000_000_000)"""							,				setup=UpperCAmelCase__							,				number=1000000	)	)
						print(timeit("""fast_primes(1_000_000_000_000)"""							,				setup=UpperCAmelCase__							,				number=1000000	)	)


if __name__ == "__main__":
	__SCREAMING_SNAKE_CASE						=      int(input("Calculate primes up to:\n>> ").strip())
	for ret in primes(number):
		print(ret)
	benchmark()




