프로그래머스(Algorithm)-소수 찾기(Brute-force)

from itertools import permutations
def solution(numbers):
    numList = list(numbers)
    perList = []
    for i in range(1,len(numList)+1):
        perList += list(permutations(numList,i))
    perListUnique = list(set([int(''.join(x)) for x in perList]))
    perListUnique = list(set([int(''.join(x)) for x in perList]))

    cnt = 0
    while perListUnique:
        flag = True
        top = perListUnique.pop()
        if top<=1:
            flag = False
        for i in range(2,top):
            if top%i==0:
                flag = False
        if flag:
            cnt += 1
    answer = cnt
    return answer