#include <bits/stdc++.h>

#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()

using namespace std;
typedef long long  ll; typedef vector<int> VI; typedef pair<ll,ll> pii; typedef vector<ll> VL; const int MD = 1e9 + 7;
void dbg(){cerr<<"\n";} template <class F,class ...S> void dbg(const F& f, const S&...s){cerr <<f <<": "; dbg(s...);}

int xs[1<<16][16], ys[1<<16][16];

int main()
{
	cin.tie(0); ios_base::sync_with_stdio(false);
	int n;
	cin >>n;
	array<ll, 18> x, y, p;
	rep(i, n) cin >>x[i] >>y[i] >>p[i];
	
	rep(i, 1<<n) rep(k, n){
		int dsx = MD,  dsy= MD;
		rep(j, n) if(j !=k &&(i>>j &1)){
			dsx = min<ll>(dsx, abs(x[k] - x[j]));
			dsy = min<ll>(dsy, abs(y[k] - y[j]));
		}
		xs[i][k] = dsx; 
		ys[i][k] = dsy; 
	}
	
	const int pj = 3;
	array<ll, 18> ans;
	ans.fill(1LL<<55);
	int mmx = 1; rep(i, n) mmx*=3;
	rep(i, mmx){
		array<ll, 18> hl, xx, yy;
		int ch=0, cs=0, hx=0, hy=0;
		for(int j=0, wki=i; j<n; j++, wki/=pj){
			int nw = wki%pj;
			if(nw==0) hl[ch++] = j;
			else if(nw==1){ hx |=(1<<j); cs++;}
			else if(nw==2){ hy |=(1<<j); cs++;}
		}
		ll sm = 0;
		rep(j, ch){
			auto z = hl[j];
			ll cnd = min(abs(x[z]), abs(y[z]));
			cnd = min<ll>(cnd, xs[hx][z]);
			cnd = min<ll>(cnd, ys[hy][z]);
			sm += cnd * p[z];
		}
		ans[cs] = min(ans[cs], sm);
	}
	
	rep(i, n+1) cout <<ans[i] <<"\n";
}

