#include<bits/stdc++.h>
using namespace std;
#define int long long
#define inf (int)2e18
#define _ <<' '<<
#define nl '\n'
map<vector<int>, int> dp;
int w[30001];
int solve(vector<int>& v){
if(dp.count(v)) return dp[v];
auto &dpv = dp[v];
int x = v.back();
auto nv = v;
nv.pop_back();
if(nv.empty() or nv.back() < x-1) nv.push_back(x-1);
dpv = solve(nv) + w[x];
for(int i = 2; i*i <= x; i++){
if(x % i != 0) continue;
nv = v;
nv.pop_back();
nv.push_back(i);
nv.push_back(x/i);
sort(nv.begin(), nv.end());
nv.erase(unique(nv.begin(), nv.end()), nv.end());
dpv = min(dpv, solve(nv) + w[x]);
}
return dpv;
}
void solve(){
int n;
cin>>n;
for(int i = 1; i <= n; i++) cin>>w[i];
dp[{1}] = w[1];
for(int i = 1; i <= n; i++){
vector<int> v = {i};
cout<<solve(v)<<nl;
}
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);cout.tie(NULL);
int t = 1;
//cin>>t;
while(t--) solve();
return 0;
}
