Code Signal: Intro=56/60

def digitsProduct(product):
    def is_prime_bad(n: int) -> bool:
        if n < 2: 
            return False 
        for i in range(2, n): 
            if n % i is 0: 
                return False 
        return True
    temp = []
    if is_prime_bad(product) == True and is_prime_bad(product)>10:
        return -1
    for i in range(2,20):
        for j in range(2,20):
            if i*j == product:
                temp.append(str(i)+str(j))
    if temp == []:
        return -1
    else:
        return int(min(temp))

3/9 sample tests passed.