"""simple docstring"""



def  _A(		lowerCAmelCase							):
							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"""							)
							A__       :     List[str]								=			""""""
							while len(lowerCAmelCase							) % 3 != 0:
														A__       :     Dict								=			"""0""" + bin_string
							A__       :     Union[str, Any]								=			[
							    bin_string[index : index + 3]
							    for index in range(len(lowerCAmelCase							)							)
							    if index % 3 == 0
							]
							for bin_group in bin_string_in_3_list:
														A__       :     Any								=			0
														for index, val in enumerate(lowerCAmelCase							):
																					oct_val += int(2 ** (2 - index) * int(lowerCAmelCase							)							)
														oct_string += str(lowerCAmelCase							)
							return oct_string


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

				testmod()






"""simple docstring"""



import math
from collections.abc import Iterator
from itertools import takewhile

def  _A(		lowerCAmelCase							):

							if 1 < number < 4:
														# 2 and 3 are primes
														return True
							elif number < 2 or number % 2 == 0 or number % 3 == 0:
														# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
														return False

							# All primes number are in format of 6k +/- 1
							for i in range(5			,  int(math.sqrt(lowerCAmelCase							) + 1							)			,  6							):
														if number % i == 0 or number % (i + 2) == 0:
																					return False
							return True

def  _A(		):
							A__       :     List[str]								=			2
							while True:
														if is_prime(lowerCAmelCase							):
																					yield num
														num += 1

def  _A(		lowerCAmelCase = 200_0000							):
							return sum(takewhile(lambda lowerCAmelCase							: x < n			,  prime_generator()							)							)


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





