

def 						lowerCamelCase__      ( __A    :str		):


       """simple docstring"""




       if not all(char in """01""" for char in bin_string		):
              raise ValueError("""Non-binary value was passed to the function"""		)
       if not bin_string:
              raise ValueError("""Empty string was passed to the function"""		)
       __snake_case       	=							""""""
       while len(__A		) % 3 != 0:
              __snake_case       	=							"""0""" + bin_string
       __snake_case       	=							[
           bin_string[index : index + 3]
           for index in range(len(__A		)		)
           if index % 3 == 0
       ]
       for bin_group in bin_string_in_3_list:
              __snake_case       	=							0
              for index, val in enumerate(__A		):
                     oct_val += int(2 ** (2 - index) * int(__A		)		)
              oct_string += str(__A		)
       return oct_string


if __name__ == "__main__":
    from doctest import testmod

    testmod()




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() = }')

