from itertools import combinations
def isPrime(n):
for i in range(2, n):
if(n%i == 0):
return False
return True
def solution(nums):
cnt = 0
combinations_list = list(combinations(nums, 3))
sum_list = []
for combination in combinations_list:
sum = combination[0]+combination[1]+combination[2]
sum_list.append(sum)
#소수 판별
for sum in sum_list:
if(isPrime(sum)==True):
cnt+=1
return cnt