#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cstdlib>
#include<cmath>
using namespace std;
struct ga{
    int id;
    int dig;
}a[10004];
int main(){
    int hush[10004];
    int n,maxn,num,i,j,minn,f;
    while(~scanf("%d",&n)&&n>=1){
        memset(hush,0,sizeof(hush));
        maxn=-1;num=0;
        for(i=0;i<n;i++){
            scanf("%d",&a[i].dig);
            a[i].id=i+1;
            if(maxn<a[i].dig)    maxn=a[i].dig;
            hush[a[i].dig]=a[i].id;
        }
        for(i=0;i<n-1;i++){
            int t=a[i].dig;
            minn=44444;f=0;
            for(j=t+t;j<=maxn;j+=t){
                if(hush[j]&&hush[j]>a[i].id){    
                    if(hush[j]<minn)    minn=hush[j];
                    f=1;
                }
            }
            if(f)    num+=minn;
        }
        printf("%d\n",num);
    }
    return 0;
}