#ifdef LOCAL
//#define _GLIBCXX_DEBUG
#endif
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<char>> VVc;
typedef vector<vector<vector<ll>>> VVV;
typedef vector<vector<vector<vector<ll>>>> VVVV;

#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF = 1e18+18;
const ll MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a, b) for(auto &a :b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#ifdef LOCAL
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) cerr << #mp << ":"<<endl; for (auto i = mp.begin(); i != mp.end(); ++i) { cerr << i->first <<":"<<i->second << endl;}
#define dbgset(st) cerr << #st << ":"<<endl; for (auto i = st.begin(); i != st.end(); ++i) { cerr << *i <<" ";}cerr<<endl;
#define dbgarr(n, m, arr) rep(i,n){rep(j,m){cerr<<arr[i][j]<<" ";}cerr<<endl;}
#define dbgdp(n, arr) rep(i,n){cerr<<arr[i]<<" ";}cerr<<endl;
#else
#define dbg(...)
#define dbgmap(...)
#define dbgset(...)
#define dbgarr(...)
#define dbgdp(...)
#endif
#define out(a) cout<<a<<endl
#define out2(a, b) cout<<a<<" "<<b<<endl
#define vout(v) rep(i,v.size()){cout<<v[i]<<" ";}cout<<endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second

template<class T>
bool chmax(T &a, const T &b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if(b < a) {
        a = b;
        return true;
    }
    return false;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }

template<typename T>
istream &operator>>(istream &i, vector<T> &v) {
    rep(j, v.size())i>>v[j];
    return i;
}

// vector
template<typename T>
ostream &operator<<(ostream &s, const vector<T> &v) {
    int len = v.size();
    for(int i = 0; i < len; ++i) {
        s<<v[i];
        if(i < len-1) s<<"	";
    }
    return s;
}

// 2 dimentional vector
template<typename T>
ostream &operator<<(ostream &s, const vector<vector<T> > &vv) {
    int len = vv.size();
    for(int i = 0; i < len; ++i) {
        s<<vv[i]<<endl;
    }
    return s;
}

int solve() {
    ll n;
    cin>>n;
    Vec x(n);
    Vec y(n);
    Vec p(n);
    rep(i, n) {
        cin>>x[i]>>y[i]>>p[i];
    }

    VV g(n+1);
    rep(bit, 1LL<<n) {
        ll pc = __builtin_popcount(bit);
        g[pc].pb(bit);
    }

    VVV G(n+1,VV(n+1));
    rep(k,n+1){
        ll mx = 1LL<<k;
        rep(bit, mx){
            ll pc = __builtin_popcount(bit);
            G[k][pc].pb(bit);
        }
    }

    VV scoreX(n,Vec(1LL<<n));
    VV scoreY(n,Vec(1LL<<n));

    rep(i,n){
        rep(bit, 1LL<<n){
            ll sx = INF;
            ll sy = INF;
            Vec xline;
            xline.pb(0);
            Vec yline;
            yline.pb(0);
            rep(j,n){
                if(bit & (1LL<<j)){
                    xline.pb(x[j]);
                    yline.pb(y[j]);
                }
            }
            Each(X, xline) {
                chmin(sx, abs(x[i]-X)*p[i]);
            }
            Each(Y, yline) {
                chmin(sy, abs(y[i]-Y)*p[i]);
            }
            scoreX[i][bit] = sx;
            scoreY[i][bit] = sy;
        }
    }

    rep(lc, n+1) {
        ll score = INF;
        rep(xlc, lc+1) {
            ll ylc = lc-xlc;

            //x組とy組に分ける
            Vec &xg = g[xlc];

            ll ymax = n-xlc;
            Vec &yg = G[ymax][ylc];
            //dbg(mp(xlc,ylc));
            Each(xbit, xg) {
                Vec cand;
                rep(i, n) {
                    if(!(xbit & (1LL<<i))) {
                        cand.pb(i);
                    }
                }

                ll csz = cand.size();
                Each(bit, yg) {
                    ll ybit = 0;
                    rep(i, csz) {
                        if(bit & (1LL<<i)) {
                            ybit += 1LL<<cand[i];
                        }
                    }
                    //dbg(mp(xbit,ybit));
                    ll sum = 0;
                    rep(i, n) {
                        ll tmp = INF;
                        chmin(tmp, scoreX[i][xbit]);
                        chmin(tmp, scoreY[i][ybit]);
                        sum += tmp;
                    }
                    chmin(score, sum);
                }
            }
        }
        out(score);
    }

    return 0;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout<<std::setprecision(10);
//    ll T;
//    cin>>T;
//    while(T--)
    solve();
}


Measured memory_bytes: 12180