#include <bits/stdc++.h>
using namespace std;
using db = long double;
using ll = long long;
using pl = pair<ll, ll>;
using pi = pair<int, int>;
#define vt vector
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end()
#define size(x) ((int) (x).size())
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define F0R(i, b) FOR (i, 0, b)
#define endl '\n'
const ll INF = 1e18;
const int inf = 1e9;
template<typename... Args> // tuples
ostream& operator<<(ostream& os, tuple<Args...> t) {
apply([&](Args... args) { string dlm = "{"; ((os << dlm << args, dlm = ", "), ...); }, t);
return os << "}";
}
template<typename T, typename V> // pairs
ostream& operator<<(ostream& os, pair<T, V> p) { return os << "{" << p.f << ", " << p.s << "}"; }
template<class T, class = decltype(begin(declval<T>()))> // iterables
typename enable_if<!is_same<T, string>::value, ostream&>::type operator<<(ostream& os, const T& v) {
string dlm = "{";
for (auto& i : v) os << dlm << i, dlm = ", ";
return os << "}";
}
template <typename T, typename... V>
void printer(string pfx, const char *names, T&& head, V&& ...tail) {
int i = 0;
while (names[i] && names[i] != ',') i++;
constexpr bool is_str = is_same_v<decay_t<T>, const char*>;
if (is_str) cerr << " " << head;
else cerr << pfx, cerr.write(names, i) << " = " << head;
if constexpr (sizeof...(tail)) printer(is_str ? "" : ",", names + i + 1, tail...);
else cerr << endl;
}
#ifdef LOCAL
#define dbg(...) printer(to_string(__LINE__) + ": ", #__VA_ARGS__, __VA_ARGS__)
#else
#define dbg(x...)
#define cerr if (0) std::cerr
#endif
main() {
cin.tie(0)->sync_with_stdio(0);
int n; cin >> n;
vt<ll> ans(1);
map<ll, int> a;
set<ll> dupes;
F0R (i, n) {
ll v; cin >> v;
a[v]++;
if (a[v] == 2) dupes.insert(v);
ans[0] += v;
}
auto die = [&] (ll x) {
auto it = a.find(x);
it->s--;
if (it->s == 1) dupes.erase(x);
if (it->s == 0) a.erase(x);
};
auto alive = [&] (ll x) {
a[x]++;
if (a[x] == 2) dupes.insert(x);
};
vt<pl> q;
ll last = -69;
F0R (_, n - 1) {
dbg(_);
if (a.begin()->f != last) {
// recalc
q.clear();
for (auto it = ++a.begin(); it != a.end(); it++) {
ll nv = gcd(a.begin()->f, it->f);
F0R (j, it->s) {
q.pb({a.begin()->f + it->f - nv, it->f});
}
}
sort(all(q));
reverse(all(q));
}
last = a.begin()->f;
ll nxtv = size(q) ? q.back().f : INF;
ll dupev = size(dupes) ? *dupes.begin() : INF;
if (min(nxtv, dupev) == nxtv) {
dbg(a);
ll x = q.back().s;
ll y = a.begin()->f;
dbg(x, y);
die(x);
die(y);
alive(gcd(x, y));
ans.pb(ans.back() - x - y + gcd(x, y));
q.pop_back();
} else {
ans.pb(ans.back() - *dupes.begin());
die(*dupes.begin());
}
}
ans.pb(a.begin()->f);
ROF (i, 0, n) cout << ans[i] << endl;
}
