#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int sosu(int n)
{
int sum=0;
for(int i=2;i<=n;i++)
{ if(n%i==0) sum++; }
return sum;
}
int solution(string numbers) {
int answer = 0;
sort(numbers.begin(),numbers.end());
vector<int> v;
do
{
for(int i=1;i<=numbers.size();i++)
{
int n= stoi(numbers.substr(0,i));
if(sosu(n)==1)
{ int count=0;
for(int i=0;i<v.size();i++)
{
if(n==v[i])
count++;
}
if(count==0)
{
v.push_back(n);
answer++;
}
}
}
} while(next_permutation(numbers.begin(),numbers.end()));
return answer;
}