def is_prime(num: int) -> bool:
    for i in range(2, int(num**0.5)+1):
        if num % i == 0:
            return False 
    
    return True

def goldbach_pair(n: int) -> list[int]:
    # Escribe tu solución aquí
    prime_list = []
    
    for i in range(2,n):
        if is_prime(i) and is_prime(n -i):
            prime_list.append(i)
            prime_list.append(n - i)
            return prime_list