'''simple docstring'''






import sys
import webbrowser

import requests
from bsa import BeautifulSoup
from fake_useragent import UserAgent

if __name__ == "__main__":
   print('''Googling.....''')
   _UpperCAmelCase    :     Any         =       '''https://www.google.com/search?q=''' + ''' '''.join(sys.argv[1:])
   _UpperCAmelCase    :     List[str]         =       requests.get(url, headers={'''UserAgent''': UserAgent().random})
   # res.raise_for_status()
   with open('''project1a.html''', '''wb''') as out_file:  # only for knowing the class
      for data in res.iter_content(1_00_00):
         out_file.write(data)
   _UpperCAmelCase    :     Tuple         =       BeautifulSoup(res.text, '''html.parser''')
   _UpperCAmelCase    :     Tuple         =       list(soup.select('''.eZt8xd'''))[:5]

   print(len(links))
   for link in links:
      if link.text == "Maps":
         webbrowser.open(link.get('''href'''))
      else:
         webbrowser.open(F'''https://google.com{link.get('href')}''')






from math import isqrt, loga







def 						lowerCamelCase__      ( __A    :int		):


       """simple docstring"""




       __snake_case       	=							[True] * max_number
       for i in range(2	,isqrt(max_number - 1		) + 1		):
              if is_prime[i]:
                     for j in range(i**2	,__A	,__A		):
                            __snake_case       	=							False

       return [i for i in range(2	,__A		) if is_prime[i]]







def 						lowerCamelCase__      ( __A    :int = 8_0_0_8_0_0	,__A    :int = 8_0_0_8_0_0		):


       """simple docstring"""




       __snake_case       	=							degree * loga(__A		)
       __snake_case       	=							int(__A		)
       __snake_case       	=							calculate_prime_numbers(__A		)

       __snake_case       	=							0
       __snake_case       	=							0
       __snake_case       	=							len(__A		) - 1
       while left < right:
              while (
                  prime_numbers[right] * loga(prime_numbers[left]		)
                  + prime_numbers[left] * loga(prime_numbers[right]		)
                  > upper_bound
              ):
                     right -= 1
              hybrid_integers_count += right - left
              left += 1

       return hybrid_integers_count


if __name__ == "__main__":
    print(F'{solution() = }')

