// This Code was made by Chinese_zjc_.
#include <bits/stdc++.h>
// #define debug
int n;
long long ans[500005];
std::vector<long long> a;
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin >> n;
    a.resize(n);
    for (int i = 0; i != n; ++i)
        std::cin >> a[i];
    ans[a.size()] = std::accumulate(a.begin(), a.end(), 0ll);
    while (a.size() >= 2)
    {
        std::pair<int, int> x;
        long long min = LLONG_MAX;
        for (std::size_t i = 0; i != a.size(); ++i)
            for (std::size_t j = i + 1; j != a.size(); ++j)
                if (a[i] + a[j] - std::__gcd(a[i], a[j]) <= min)
                    x = {i, j}, min = a[i] + a[j] - std::__gcd(a[i], a[j]);
        long long nxt = std::__gcd(a[x.first], a[x.second]);
        a.erase(a.begin() + x.second);
        a.erase(a.begin() + x.first);
        a.push_back(nxt);
        ans[a.size()] = std::accumulate(a.begin(), a.end(), 0ll);
    }
    for (int i = 1; i <= n; ++i)
        std::cout << ans[i] << '\n';
    return 0;
}