/*+Rainybunny+*/

#include <bits/stdc++.h>

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

typedef long long LL;

inline char fgc() {
    static char buf[1 << 17], *p = buf, *q = buf;
    return p == q && (q = buf + fread(p = buf, 1, 1 << 17, stdin), p == q)
    ? EOF : *p++;
}

template <typename Tp = int>
inline Tp rint() {
    Tp x = 0, s = fgc(), f = 1;
    for (; s < '0' || '9' < s; s = fgc()) f = s == '-' ? -f : f;
    for (; '0' <= s && s <= '9'; s = fgc()) x = x * 10 + (s ^ '0');
    return x * f;
}

template <typename Tp>
inline void wint(Tp x) {
    if (x < 0) putchar('-'), x = -x;
    if (9 < x) wint(x / 10);
    putchar(x % 10 ^ '0');
}

const int MAXN = 5e5;
const LL LINF = 1ll << 60;
int n;
LL a[MAXN + 5], pre[MAXN + 5], gcv[MAXN + 5];

int main() {
    // freopen("divide.in", "r", stdin);
    // freopen("divide.out", "w", stdout);

    n = rint();
    rep (i, 1, n) a[i] = rint<LL>();

    std::sort(a + 1, a + n + 1), pre[1] = a[1];
    rep (i, 2, n) pre[i] = std::__gcd(pre[i - 1], a[i]);

    LL ans = LINF, sam = LINF, sum = 0;
    for (int i = n, j = n; i >= 2; --i) {
        sum += a[i];
        if (i < n && a[i] == a[i + 1]) sam = a[i];
        for (j = i - 1; a[j] == a[j + 1]; --j);
        if (pre[j] != pre[i]) {
            LL d = pre[j] / pre[i];
            rep (k, i + 1, n) {
                gcv[k] *= std::__gcd(a[k] / gcv[k], d); // O(n\log V) in total.
                ans = std::min(ans, a[k] - gcv[k]);
            }
        }
        gcv[i] = std::__gcd(a[i], pre[i - 1]);
        ans = std::min(ans, a[i] - gcv[i]);
        wint(sum - std::min(ans, sam - pre[i - 1])), putchar('\n');
    }
    wint(sum += a[1]), putchar('\n');
    return 0;
}