


"""simple docstring"""



from __future__ import annotations

import math







def     __lowerCAmelCase		(		lowercase    :    Any					)      ->		str:


    """simple docstring"""





    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


__snake_case       =       [num for num in range(3, 100001, 2) if not is_prime(num)]







def     __lowerCAmelCase		(		lowercase    :    Union[str, Any]					)      ->		Any:


    """simple docstring"""





    if not isinstance(lowerCAmelCase__		,				lowerCAmelCase__					):
        raise ValueError("n must be an integer"					)
    if n <= 0:
        raise ValueError("n must be >= 0"					)

    snake_case       : List[Any]    =       []
    for num in range(len(lowerCAmelCase__					)					):
        snake_case       : Any    =       0
        while 2 * i * i <= odd_composites[num]:
            snake_case       : List[str]    =       odd_composites[num] - 2 * i * i
            if is_prime(lowerCAmelCase__					):
                break
            i += 1
        else:
            list_nums.append(odd_composites[num]					)
            if len(lowerCAmelCase__					) == n:
                return list_nums

    return []







def     __lowerCAmelCase		(		)      ->		Optional[int]:


    """simple docstring"""





    return compute_nums(1					)[0]


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












_lowercase		:  Any			       ={"""a""": ["""c""", """b"""], """b""": ["""d""", """e"""], """c""": [], """d""": [], """e""": []}
_lowercase		:  Union[str, Any]			       =["""a""", """b""", """c""", """d""", """e"""]


def 		_SCREAMING_SNAKE_CASE     ( lowerCAmelCase__							,lowerCAmelCase__							,lowerCAmelCase__						):
		lowerCamelCase_	:     int 						=      start
		# add current to visited
		visited.append(lowerCAmelCase__						)
		lowerCamelCase_	:     Optional[int] 						=      edges[current]
		for neighbor in neighbors:
				# if neighbor not in visited, visit
				if neighbor not in visited:
						lowerCamelCase_	:     Dict 						=      topological_sort(lowerCAmelCase__							,lowerCAmelCase__							,lowerCAmelCase__						)
    # if all neighbors visited add current to sort
		sort.append(lowerCAmelCase__						)
		# if all vertices haven't been visited select a new one to visit
		if len(lowerCAmelCase__						) != len(lowerCAmelCase__						):
				for vertice in vertices:
						if vertice not in visited:
								lowerCamelCase_	:     Any 						=      topological_sort(lowerCAmelCase__							,lowerCAmelCase__							,lowerCAmelCase__						)
    # return sort
		return sort


if __name__ == "__main__":
		_lowercase		:  str			       =topological_sort("""a""", [], [])
		print(sort)
