#include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <cstdlib>

 #include <cmath>

 #include <algorithm>

 #define LL __int64

 const int maxn = +;

 using namespace std;

 LL a[maxn], pre[maxn], af[maxn], vis[maxn], sum;

 int main()

 {

     int n, i, j, tmp;

     while(~scanf("%d", &n) && n)

     {

         memset(af, , sizeof(af));

         memset(pre, , sizeof(pre));

         memset(vis, , sizeof(vis));

         for(i = ; i <= n; i++)

         scanf("%I64d", &a[i]);

         for(i = ; i <= n; i++)

         {

             if(vis[a[i]])

             pre[i] = a[vis[a[i]]];

             else

             pre[i] = a[i];

             tmp = (int)sqrt(a[i]);

             for(j = ; j <= tmp; j++)

             if(a[i]%j==)

             {

                 vis[j] = i;

                 vis[a[i]/j] = i;  //一定不要忘了sqrt后面还有这个数的除数

             }

         }

         memset(vis, , sizeof(vis));

         for(i = n; i >= ; i--)

         {

             if(vis[a[i]])

             af[i] = a[vis[a[i]]];

             else

             af[i] = a[i];

             tmp = (int)sqrt(a[i]);

             for(j = ; j <= tmp; j++)

             if(a[i]%j==)

             {

                 vis[j] = i;

                 vis[a[i]/j] = i;

             }

         }

         sum = ;

         for(i = ; i <= n; i++)

         sum += pre[i]*af[i];

         printf("%I64d\n", sum);

     }

     return ;

 }