from itertools import permutations

def isPrime(n):
    if n<=1:
        return False
    for i in range(2,int(n**0.5)+1):
        if n%i==0:
            return False
    return True

def solution(numbers):
    per = []
    for i in range(1,len(numbers)+1):
        per.extend(list(permutations(list(numbers),i)))
    
    for i in range(len(per)):
        per[i]=int("".join(per[i]))
    
    answer=0
    for i in set(per):
        if isPrime(i):
            answer+=1
            
    return answer