#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
#define ll long long
#define N 10005
#define mem(a,t) memset(a,t,sizeof(a))
const double eps=1e-4;
const int mod=123456;
int a[N];
struct node
{
    int x,id;
}b[N];

bool cmp(node a,node b)
{
    return a.x<b.x;
}
int main()
{
    //freopen("in.txt","r",stdin);
    int i,n;
    int t,l,r;
    while(~scanf("%d",&n))
    {
        for(i=0;i<n;i++)
        {
            scanf("%d",&b[i].x);
            b[i].id=i;
        }
        sort(b,b+n,cmp);
        for(i=0;i<n;i++)
            a[i]=b[i].x;
        int sum=0;
        for(i=0;i<n;i++)
        {
            t=a[i]*2;
            int t1=n*2;
            while(t<=a[n-1])
            {
                l=lower_bound(a,a+n,t)-a;
                r=upper_bound(a,a+n,t)-a;
                //printf("%d %d %d\n",a[i],l,r);
                if(r-l>=1&&b[l].id>b[i].id&&t1>b[l].id)
                {
                    t1=b[l].id;
                }
                t+=a[i];
            }
            if(t1!=2*n)
                sum+=t1+1;
        }
        printf("%d\n",sum);
    }
    return 0;
}