#include<bits/stdc++.h>
#define int long long
#define eb emplace_back
#define mp make_pair
#define DEBUG
using namespace std;
using pii = pair<int, int>;
using piii = pair<int, pii>;
using piiii = pair<pii, pii>;
using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned int;
const int P = 998244353;const i64 inf = 0x3f3f3f3f3f3f3f3f;
namespace azus{
	int n;
	int a[100005];
	multiset<int> s;
	int res[100005];
	int main(){
		cin >> n;
		for(int i = 1; i <= n; i ++){
			cin >> a[i];
		}
		int ans = 0;
		for(int i = 1; i <= n; i ++)
			ans += a[i], s.insert(a[i]);
		res[n] = ans;
		for(int i = n - 1; i >= 1; i --){
			vector<int> v;
			for(int j : s){
				v.eb(j);
				// cout << j << " ";
			}
			// cout << "\n";
			int m = v.size();
			int cans = 0, x = -1, y = -1;
			for(int j = 0; j < m; j ++){
				for(int k = j + 1; k < m; k ++){
					if(int r = ans - v[j] - v[k] + __gcd(v[j], v[k]); r > cans)
						cans = r, x = j, y = k;
				}
			}
			// cout << v[x] << " " << v[y] << " " << cans << "\n";
			s.erase(s.find(v[x]));
			s.erase(s.find(v[y]));
			s.insert(__gcd(v[x], v[y]));
			ans = cans;
			res[i] = ans;
		}
		for(int i = 1; i <= n; i ++)
			cout << res[i] << "\n";
		return 0;
	}
}
signed main(){
#ifndef DEBUG
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
#endif
	int T = 1;
	while(T --)
		azus::main();
	return 0;
}