#include <bits/stdc++.h>

#define rep( i, a, b ) for( int i = (a) ; i <= (b) ; i ++ )
#define per( i, a, b ) for( int i = (a) ; i >= (b) ; i -- )

typedef long long LL;

const int MAXN = 5e5 + 5;

template<typename _T>
inline void Read( _T &x ) {
	x = 0; char s = getchar(); bool f = false;
	while( s < '0' || '9' < s ) { f = s == '-', s = getchar(); }
	while( '0' <= s && s <= '9' ) { x = ( x << 3 ) + ( x << 1 ) + ( s - '0' ), s = getchar(); }
	if( f ) x = -x;
}

template<typename _T>
inline void Write( _T x ) {
	if( x < 0 ) putchar( '-' ), x = -x;
	if( 9 < x ) Write( x / 10 );
	putchar( x % 10 + '0' );
}

template<typename _T>
inline _T Max( const _T &a, const _T &b ) {
	return a > b ? a : b;
}

LL ans[MAXN];
LL prefGcd[MAXN], suffSum[MAXN];

LL A[MAXN], B[MAXN];
int tot = 0;

int N;

inline LL Gcd( LL x, LL y ) { for( LL z ; y ; z = x, x = y, y = z % y ); return x; }

inline void Perform( const LL &d ) {
	if( d > 0 ) {
		LL res = d; 
		int cnt = 1, inc = 0;
		for( int l = 1, r ; l <= N ; l = r ) {
			for( r = l ; r <= N && A[l] == A[r] ; r ++ );
			if( A[l] % d != 0 ) cnt ++, res += A[l];
			else inc += r - l;
		}
		if( ! inc ) return ;
		ans[cnt] = Max( ans[cnt], res );
		for( int r = N, l ; r >= 1 ; r = l ) {
			for( l = r ; l >= 1 && A[l] == A[r] ; l -- );
			int tims = r - l - ( A[r] % d != 0 );
			rep( i, 1, tims ) {
				cnt ++, res += A[r], inc -= A[r] % d == 0;
				if( ! inc ) return ;
				ans[cnt] = Max( ans[cnt], res );
			}
		}
	} else {
		LL res = 0; int cnt = 0;
		for( int l = 1, r ; l <= N ; l = r ) {
			for( r = l ; r <= N && A[l] == A[r] ; r ++ );
			cnt ++, res += A[l];
		}
		ans[cnt] = Max( ans[cnt], res );
		for( int r = N, l ; r >= 1 ; r = l ) {
			for( l = r ; l >= 1 && A[l] == A[r] ; l -- );
			int tims = r - l - 1;
			rep( i, 1, tims ) {
				cnt ++, res += A[r];
				ans[cnt] = Max( ans[cnt], res );
			}
		}
	}
}

namespace Force {
	inline void Solve() {
		rep( k, 0, A[N] ) Perform( k );
	}
}

namespace Guess {
	inline void Solve() {
		Perform( 0 );
		Perform( 1 );
		per( i, N, 1 ) suffSum[i] = suffSum[i + 1] + A[i];
		rep( i, 1, N ) prefGcd[i] = Gcd( prefGcd[i - 1], A[i] );
		rep( i, 1, N ) ans[i] = Max( ans[i], prefGcd[N - i + 1] + suffSum[N - i + 2] );
	}
}

int main() {
	Read( N );
	rep( i, 1, N ) Read( A[i] );
	std :: sort( A + 1, A + 1 + N );
	if( A[N] <= 2000 && N <= 2000 )
		Force :: Solve();
	else
		Guess :: Solve();
	rep( i, 1, N ) Write( ans[i] ), putchar( '\n' );
	return 0;
}