#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
int l[10005],a[10005],ans;
int n;
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        memset(l,1,sizeof(l));ans=0;
        for(int i=1;i<=n;i++)scanf("%d",a+i);
        for(int i=n;i>0;i--)
        {
            int t=10005;
            for(int j=a[i]*2;j<=10000;j+=a[i])
                t=min(t,l[j]);
            if(t<10005)ans+=t;
            l[a[i]]=i;
        }
        printf("%d\n",ans);
    }
    return 0;
}