#include <bits/stdc++.h>
#define pii pair <int , int>
#define pll pair <LL , LL>
#define mp make_pair
#define fs first
#define sc second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;

//const int Mxdt=100000;
//static char buf[Mxdt],*p1=buf,*p2=buf;
//#define getchar() p1==p2&&(p2=(p1=buf)+fread(buf,1,Mxdt,stdin),p1==p2)?EOF:*p1++;

template <typename T>
void read(T &x) {
	T f=1;x=0;char s=getchar();
	while(s<'0'||s>'9') {if(s=='-') f=-1;s=getchar();}
	while(s>='0'&&s<='9') {x=(x<<3)+(x<<1)+(s^'0');s=getchar();}
	x *= f;
}

template <typename T>
void write(T x , char s='\n') {
	if(!x) {putchar('0');putchar(s);return;}
	if(x<0) {putchar('-');x=-x;}
	T t = 0 , tmp[25] = {};
	while(x) tmp[t ++] = x % 10 , x /= 10;
	while(t -- > 0) putchar(tmp[t] + '0');
	putchar(s);
}

const int MAXN = 5e5 + 5;

LL n , a[MAXN];

int Gcd(int a , int b) {
	if(!b) return a;
	return Gcd(b , a % b);
}

namespace BF {
	LL f[(1 << 15) + 5][20] , v[(1 << 15) + 5] , Cnt[(1 << 15) + 5] , Ans[20];
	void solve() {
		for (int s = 0; s < (1 << n); ++s) {
			for (int i = 1; i <= n; ++i) if((s >> (i - 1)) & 1) {
				v[s] = Gcd(v[s] , a[i]); 
			}
			for (int i = 0; i <= n; ++i) f[s][i] = -1e18;
		}
		
		f[0][0] = 0;
		for (int i = 1; i <= n; ++i)
			for (int s = 1; s < (1 << n); ++s) {
				for (int t = s; t; t = (t - 1) & s) {
					f[s][i] = max(f[s][i] , f[s ^ t][i - 1] + v[t]);
				}
			}
		for (int i = 1; i <= n; ++i) write(f[(1 << n) - 1][i]);
	}
}

LL Ans[MAXN] , pre[MAXN];

int main() {
//	freopen("divide.in" , "r" , stdin);
//	freopen("divide.out" , "w" , stdout);
	read(n);
	for (int i = 1; i <= n; ++i) {
		read(a[i]);
		Ans[n] += a[i];
	}
	sort(a + 1 , a + 1 + n);
	vector <LL> d;
	for (int i = 1; i <= n; ++i) {
		pre[i] = Gcd(pre[i - 1] , a[i]);
		if(pre[i] != pre[i - 1]) {
			for (LL j = 1; j * j <= pre[i]; ++j) {
				if(pre[i] % j) continue;
				d.push_back(j);
				if(pre[i] / j != j) d.push_back(pre[i] / j); 
			}
		}
	}
	sort(d.begin() , d.end());
	int m = unique(d.begin() , d.end()) - d.begin();
	d.resize(m);
	
	for (auto i:d) {
		int num = 1 , tot = 0; 
		LL val = 0;
		priority_queue <LL , vector <LL> , less <LL> > Q;
		for (int j = 1; j <= n; ++j) 
			if(a[j] % i == 0) {
				if(tot) Q.push(a[j]);
				tot ++;
			}
			else if(a[j] != a[j - 1]) val += a[j] , num ++;
			else Q.push(a[j]);
		if(!tot) continue;
		Ans[num] = max(Ans[num] , val + i);
		while(!Q.empty()) {
			val += Q.top();
			num ++;
			Q.pop();
			Ans[num] = max(Ans[num] , val + i);
		}
	}
	for (int i = 1; i <= n; ++i) Ans[i] = max(Ans[i - 1] , Ans[i]) , write(Ans[i]);
	
	return 0;
}