分成互质组

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;
long long f[11];
int n,minn=10,a[11];
long long gcd(long long a,long long b)
{
    if(!b)return a;
    return gcd(b,a%b);
}
void s(int i,int k){
    if(i==n+1)
    {
        if(k<minn)minn=k;
        return ;
    }
    for(int j=1;j<=k;j++)
    {
        if(gcd(f[j],a[i])==1)
        {
            f[j]*=a[i];
            s(i+1,k);
            f[j]/=a[i];
        }
    }
    f[k+1]=a[i];
    s(i+1,k+1);
    f[k+1]=0;
}
int main(){
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    for(int i=1;i<11;i++)f[i]=1;
    s(1,1);
    cout<<minn<<endl;
}