// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") // codeforces
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native") // yandex

#include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif

#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound

typedef long long ll;
typedef long double f80;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

int pct(int x) { return __builtin_popcount(x); }
int pct(ll x) { return __builtin_popcountll(x); }
int bt(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
int bt(ll x) { return 63 - __builtin_clzll(x); } // floor(log2(x))
int cdiv(int a, int b) { return a / b + !(a < 0 || a % b == 0); }
ll cdiv(ll a, ll b) { return a / b + !(a < 0 || a % b == 0); }
int nxt_C(int x) { int c = x & -x, r = x + c; return (((r ^ x) >> 2) / c) | r; }
ll nxt_C(ll x) { ll c = x & -x, r = x + c; return (((r ^ x) >> 2) / c) | r; }

vector<int> get_bits(int mask) {
	vector<int> bb;
	while(mask) { int b = bt(mask); bb.pb(b); mask ^= (1 << b); }
	reverse(all(bb));
	return bb;
}

int get_mask(vector<int> v) {
	int mask = 0;
	for(int x : v) { mask ^= (1 << x); }
	return mask;
}

template<typename T>
void uniq(vector<T> &v) { sort(all(v)); v.resize(unique(all(v)) - v.begin()); }

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

ll rand(ll l, ll r){
	uniform_int_distribution<ll> uid(l, r);
	return uid(rng);
}

void sc() {}

template <typename Head, typename... Tail>
void sc(Head &H, Tail &... T) { cin >> H; sc(T...); }

#ifdef LOCAL
#define debug(...) cerr << "[L:" << __LINE__ << "][" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

// #ifndef LOCAL
// string to_string(__int128 x) {
// 	string s = "";
// 	bool neg = 0;
// 	if(x < 0) { s += "-"; neg = 1; x = -x; }
// 	if(!x) s += '0';
// 	while(x) {
// 		int rem = x % 10;
// 		s += to_string(rem);
// 		x /= 10;
// 	}
// 	reverse(s.begin() + neg, s.end());
// 	return s;
// }
// #endif

const int mod = 1e9 + 7; // 998244353;

int pwr(int a,ll b) {
	int ans = 1;
	while(b) {
		if(b & 1) ans = (ans * 1LL * a) % mod;
		a = (a * 1LL * a) % mod;
		b >>= 1;
	}
	return ans;
}

/*
	Lookout for overflows!!
	Check array sizes!!
	Clear before test cases!!
	Use the correct modulo!!
	Check for corner cases!!
	Are you forgetting something?!
	Read problem statement carefully!!!
*/

const int N = 20;
ll x[N], y[N], p[N];
ll cost[N][N];
ll dp[N][N];

void solve() {
	int n;
    sc(n);
    fr(i, 1, n) {
        sc(x[i], y[i], p[i]);
    }
    vector<ll> ans(2 * n + 1, LLONG_MAX);
    for(int mask = 0; mask < (1 << n); mask++) {
        vector<ll> dist(n + 1, LLONG_MAX);
        fr(i, 1, n) {
            dist[i] = min(abs(x[i]), abs(y[i]));
        }
        fr(j, 0, n - 1) {
            if((mask >> j) & 1) {
                fr(i, 1, n) {
                    dist[i] = min(dist[i], abs(x[j + 1] - x[i]));
                }
            }
        }
        vector<pair<ll,pll>> v;
        v.pb({-1e9, {0, 0}});
        fr(i, 1, n) {
            v.pb({y[i], {dist[i], p[i]}});
        }
        v.pb({1e9, {0, 0}});
        sort(all(v));
        fr(i, 0, n + 1) {
            fr(j, 0, i) {
                dp[i][j] = LLONG_MAX;
            }
        }
        fr(i, 0, n + 1) {
            fr(j, i + 1, n + 1) {
                cost[i][j] = 0;
                fr(k, i + 1, j - 1) {
                    ll cur = v[k].se.fi;
                    cur = min(cur, abs(v[i].fi - v[k].fi));    
                    cur = min(cur, abs(v[j].fi - v[k].fi));
                    cost[i][j] += cur * v[k].se.se;     
                }
            }
        }
        dp[0][0] = 0;
        fr(i, 0, n + 1) {
            fr(k, 0, i) {
                if(dp[i][k] == LLONG_MAX) continue;
                fr(j, i + 1, n + 1) {
                    dp[j][k + 1] = min(dp[j][k + 1], dp[i][k] + cost[i][j]);
                }
            }
        }
        fr(k, 1, n + 1) {
            int kk = (k - 1) + pct(mask);
            if(kk <= n)
                ans[kk] = min(ans[kk], dp[n + 1][k]);
        }
    }
    fr(i, 0, n) {
        cout << ans[i] << endl;
    }
}

int main() {
	ios :: sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
	// cin >> t;
	for(int tt = 1; tt <= t; tt++) {
		solve();
	}
	return 0;
}

Measured memory_bytes: 3664