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

long long vc[100001];

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]);
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=100000;j++)
            if(vc[j]!=0)
                vc[prim(j,v[i])]+=vc[j];
        vc[v[i]]++;
    }
    printf("%lld",vc[1]);
    return 0;
}