#include <bits/stdc++.h>

using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
// const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

vl dp(vector<pii> xp) {
    int n = xp.size();

    vector<vll> dp(n + 1, vll(n + 1, vl(3, INF)));
    dp[0][0][0] = 0;
    rep (i, n) {
        rep (j, n + 1) {
            rep (k, 3) {
                if (dp[i][j][k] == INF) continue;
                if (k == 0 or k == 1) {
                    chmin(dp[i][j][k + 1], dp[i][j][k]);
                }
                if (k == 1) {
                    chmin(dp[i + 1][j][k], dp[i][j][k] + abs(xp[i].first) * xp[i].second);
                }
                else {
                    int poll = i;
                    ll left = 0, just = 0, right = 0;
                    ll left_dist = 0, right_dist = 0;
                    for (int l = i; l < n; l++) {
                        if (poll == l) just += xp[l].second;
                        else {
                            right += xp[l].second;
                            right_dist += xp[l].second * (xp[l].first - xp[poll].first);
                        }
                        while (poll < l and left + just < right) {
                            left += just;
                            left_dist += (xp[poll + 1].first - xp[poll].first) * left;
                            right_dist -= (xp[poll + 1].first - xp[poll].first) * right;
                            poll++;
                            just = xp[poll].second;
                            right -= just;                   
                        }
                        // DEBUG(pll(left_dist, right_dist));
                        // DEBUG(pll(left, right));
                        chmin(dp[l + 1][j + 1][k], dp[i][j][k] + left_dist + right_dist);
                    }
                }
            }
        }
    }

    vector<ll> ans(n + 1);
    rep (i, n + 1) {
        ans[i] = min({dp[n][i][0], dp[n][i][1], dp[n][i][2]});
    }
    return ans;
}

signed main() {
    fio();
    
    int n;
    cin >> n;
    vector<pii> xy(n);
    vector<int> p(n);
    rep (i, n) {
        cin >> xy[i].first >> xy[i].second >> p[i];
    }

    vl ans(n + 1, INF);
    rep (i, 1 << n) {
        vector<pii> xp, yp;
        rep (j, n) {
            if (i & (1 << j)) xp.push_back(pii(xy[j].first, p[j]));
            else yp.push_back(pii(xy[j].second, p[j]));
        }

        sort(all(xp));
        sort(all(yp));

        vl dp1 = dp(xp), dp2 = dp(yp);
        rep (i, dp1.size()) {
            rep (j, dp2.size()) {
                int k = i + j;
                chmin(ans[k], dp1[i] + dp2[j]);
            }
        }
    }

    rep (i, n + 1) {
        cout << ans[i] << endl;
    }
}

Measured memory_bytes: 3712