//#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <algorithm>

using namespace std;

vector<int> gao(vector<int> a)
{
	vector<int> res;
	map<int, int> vis;
	for (int i = 0; i < a.size(); i++) {
		res.push_back(vis[a[i]]);
		if (res[i] == 0) res[i] = i + 1;
		for (long long j = 1; j * j <= a[i]; j++) {
			if (a[i] % j == 0) {
				vis[j] = i + 1;
				vis[a[i] / j] = i + 1;
			}
		}
	}
	return res;
}

int a[100010];

int main()
{
	ios::sync_with_stdio(false);
	int n;
	while (cin >> n && n) {
		vector<int> Q;
		for (int i = 1; i <= n; i++) {
			cin >> a[i];
			Q.push_back(a[i]);
		}
		vector<int> b = gao(Q);
		reverse(Q.begin(), Q.end());
		vector<int> c = gao(Q);
		long long ans = 0;
		for (int i = 0; i < n; i++) {
			ans += (long long)(a[b[i]]) * (long long)(a[n - c[n - i - 1] + 1]);
		}
		cout << ans << '\n';
	}
	return 0;
}