#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template <typename V, typename T> void ndfill(V &x, const T &val) { x = val; }
template <typename V, typename T> void ndfill(vector<V> &vec, const T &val) { for (auto &v : vec) ndfill(v, val); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> srtunq(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; }
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;

int main()
{
    int N;
    cin >> N;
    vector<int> X(N), Y(N), P(N);
    vector<pair<pint, int>> YXP;
    REP(i, N)
    {
        int x, y, p;
        cin >> x >> y >> p;
        YXP.emplace_back(pint(y, x), p);
    }
    sort(ALL(YXP));
    REP(i, N)
    {
        tie(Y[i], X[i]) = YXP[i].first;
        P[i] = YXP[i].second;
    }
    vector<lint> ret(N + 1, 1e18);
    

    REP(S, 1 << N)
    {
        vector<int> cost(N);
        REP(i, N)
        {
            int c = min(abs(X[i]), abs(Y[i]));
            REP(j, N) if ((S >> j) & 1) chmin(c, abs(X[i] - X[j]));
            cost[i] = c;
        }

        vector dp(N + 1, vector<lint>(N + 1, 1e18));
        dp[0][__builtin_popcount(S)] = 0;
        lint t_ = 0;
        REP(i, N) t_ += 1LL * cost[i] * P[i];
        chmin(ret[__builtin_popcount(S)], t_);

        REP(last, N) REP(c, N) if (dp[last][c] < 1e18)
        {
            FOR(j, last + 1, N + 1)
            {
                lint tmp = 0;
                FOR(i, last, j)
                {
                    int d = min(cost[i], Y[j - 1] - Y[i]);
                    if (last) chmin(d, Y[i] - Y[last - 1]);
                    tmp += 1LL * d * P[i];
                }
                chmin(dp[j][c + 1], dp[last][c] + tmp);
                FOR(i, j, N) tmp += 1LL * min(cost[i], Y[i] - Y[j - 1]) * P[i];
                chmin(ret[c + 1], dp[last][c] + tmp);
            }
        }
    }

    for (auto x : ret) cout << x << '\n';
}


Measured memory_bytes: 3648