#include<cstdio>
using namespace std;
int n, v[501];
bool prim(int a,int b){
    int r;
    while(b){
        r=a%b;
        a=b;
        b=r;
    }
    if(a==1)
        return true;
    return false;
}

int ridic(int a, int p){
    int rez=a;
    for(int i=2;i<=p;i++)
        rez*=2;
    return rez;
}

int main(){
    freopen("indep.in","r",stdin);
    freopen("indep.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",&v[i]);
    int cate=0;
    for(int i=1;i<=n;i++)
        for(int j=i+1;j<=n;j++)
            if(prim(v[i],v[j])==true)
                cate++;
    int putere=ridic(2,n-2)-1;
    printf("%d",cate*putere);
    return 0;
}