#include <iostream>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <string>
#include <sstream>
#include <algorithm>
#include <random>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
#include <cassert>
#include <climits>
#include <bitset>
#include <functional>
#include <iomanip>
#include <random>

#define FOR_LT(i, beg, end) for (int i = (int)(beg); i < (int)(end); i++)
#define FOR_LE(i, beg, end) for (int i = (int)(beg); i <= (int)(end); i++)
#define FOR_DW(i, beg, end) for (int i = (int)(beg); (int)(end) <= i; i--)
#define REP(n)              for (int repeat_index = 0; repeat_index < (int)n; repeat_index++)

double E = 2.71828182845904523536028747;

using namespace std;

struct P {
	int64_t x;
	int64_t y;
	int64_t p;
};

int64_t evaluate(const vector<P>& ps, const vector<int64_t> xl, const vector<int64_t> yl, const vector<bool> sel)
{
	int64_t sum = 0;

	vector<int64_t> cxl;
	vector<int64_t> cyl;
	FOR_LT(i, 0, sel.size()) {
		if (sel[i]) {
			if (i < xl.size()) cxl.push_back(xl[i]);
			else               cyl.push_back(yl[i - xl.size()]);
		}
	}

	for (auto& p : ps) {
		int64_t minv = min(abs(p.x), abs(p.y)) * p.p;
		for (auto& x : cxl) {
			minv = min(minv, abs(p.x - x) * p.p);
		}
		for (auto& y : cyl) {
			minv = min(minv, abs(p.y - y) * p.p);
		}
		sum += minv;
	}
	return sum;
}

int64_t annealing(vector<P>& ps, vector<int64_t>& xl, vector<int64_t>& yl, int n)
{
	if (xl.size() + yl.size() <= n) return 0;
	

	int nl = xl.size() + yl.size();
	vector<bool> sel(nl);

	static random_device rnd;
	static mt19937 mt(rnd());

	uniform_int_distribution<>        sell(0, nl - 1);
	uniform_int_distribution<>        selk(0, n - 1);
	uniform_int_distribution<>        selnk(0, nl - n - 1);
	uniform_real_distribution<double> selr(0, 1.0);

	FOR_LT(i, 0, n) {
		while (true) {
			int l = sell(mt);
			if (sel[l]) continue;
			sel[l] = true;
			break;
		}
	}

	int64_t ans  = evaluate(ps, xl, yl, sel);
	int64_t cans = ans;
	double  t    = ans;
	double  lt   = t;
	int repeat = 100000;
	REP(repeat) {
		//cout << ans << " " << cans << " " << t << endl;
		int  k = selk(mt);
		int nk = selnk(mt);

		int kidx = 0;
		{
			for (int i = 0; i < k; i++) {
				while (!sel[kidx]) kidx++;
				kidx++;
			}
			while (!sel[kidx]) kidx++;
		}

		int nkidx = 0;
		{
			for (int i = 0; i < nk; i++) {
				while (sel[nkidx]) nkidx++;
				nkidx++;
			}
			while (sel[nkidx]) nkidx++;
		}

		sel[kidx]  = false;
		sel[nkidx] = true;
		int64_t nans = evaluate(ps, xl, yl, sel);
		if (nans < cans) {
			cans = nans;
			ans = min(ans, cans);
		}
		else {
			if (selr(mt) < exp((cans - nans) / t)) {
				cans = nans;
			}
			else {
				sel[kidx] = true;
				sel[nkidx] = false;
			}
		}

		lt = 0.9 * lt + 0.1 * (cans - ans);
		if (lt < 1E-10) break;
		t = (repeat - repeat_index)/ repeat * lt;
	}
	
	return ans;
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout << fixed << setprecision(20);

	int n; cin >> n;

	vector<P> ps(n);
	FOR_LT(i, 0, n) {
		auto& p = ps[i];
		cin >> p.x >> p.y >> p.p;
	}

	vector<int64_t> xl(n);
	FOR_LT(i, 0, n) {
		xl[i] = ps[i].x;
	}
	sort(xl.begin(), xl.end());
	xl.erase(unique(xl.begin(), xl.end()), xl.end());

	vector<int64_t> yl(n);
	FOR_LT(i, 0, n) {
		yl[i] = ps[i].y;
	}
	sort(yl.begin(), yl.end());
	yl.erase(unique(yl.begin(), yl.end()), yl.end());

	cout << evaluate(ps, xl, yl, vector<bool>()) << endl;
	FOR_LE(i, 1, n) {
		int64_t ans = INT64_MAX;
		for (int k = 0; k < 64; k++) {
			ans = min(ans, annealing(ps, xl, yl, i));
		}
		cout << ans << endl;
	}

	return 0;
}

Measured memory_bytes: 3976