#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e18 + 1e18;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

//////////////////////////////////////

int main() {
	ll N;
	cin >> N;
	vll X(N + 1), Y(N + 1), P(N + 1);
	repn(i, N)cin >> X[i] >> Y[i] >> P[i];

	vector<pair<int, int>> px(N + 1), py(N + 1);
	repn(i, N) {
		px[i] = { X[i],i };
		py[i] = { Y[i],i };
	}
	sort(++px.begin(), px.end());
	sort(++py.begin(), py.end());

	int c = 1;
	repn(i, N)c *= 3;
	vll ans(N + 1, INF);

	repn(i, c) {
		vector<int> v(N + 1);

		int count = 0;
		ll t = i;
		repn(i, N) {
			v[i] = t % 3;
			t /= 3;
			if (v[i] != 0) { count++; }
		}

		//cout << i << count << endl;

		
		vector<int> dis(N + 1);
		repn(i, N)dis[i] = min(abs(X[i]), abs(Y[i]));

		ll k = -1;
		repn(i, N) {
			if (v[px[i].second] == 1) { k = px[i].second; }
			if (k != -1) { dis[px[i].second] = min(dis[px[i].second], px[i].first - X[k]); }
		}
		k = -1;
		for (ll i = N; i >= 1; i--) {
			if (v[px[i].second] == 1) { k = px[i].second; }
			if (k != -1) { dis[px[i].second] = min(dis[px[i].second], X[k] - px[i].first); }
		}

		k = -1;
		repn(i, N) {
			if (v[py[i].second] == 2) { k = py[i].second; }
			if (k != -1) { dis[py[i].second] = min(dis[py[i].second], py[i].first - Y[k]); }
		}
		k = -1;
		for (ll i = N; i >= 1; i--) {
			if (v[py[i].second] == 2) { k = py[i].second; }
			if (k != -1) { dis[py[i].second] = min(dis[py[i].second], Y[k] - py[i].first); }
		}

		ll now = 0;
		repn(i, N)now += P[i] * dis[i];
		ans[count] = min(ans[count], now);
	}

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


Measured memory_bytes: 3592