#include <iostream>
#include <iomanip>
#include <fstream>
#include <string>
#include <array>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>
#include <bitset>
#include <tuple>
#include <cmath>
#include <complex>
#include <algorithm>
#include <utility>
#include <regex>
#include <cstdint>
#include <numeric>
#include <functional>
#include <cassert>

using namespace std;

namespace utils{
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
    ///----- aliases
    using i32 = int32_t;
    using u32 = uint32_t;
    using i64 = int64_t;
    using u64 = uint64_t;
    using ll = i64;
    using ull = u64;

    using f32 = float;
    using f64 = double;

    template<class T, class Compare> using p_queue = priority_queue<T, vector<T>, Compare>;
    template<class T> using min_queue = p_queue<T, greater<T>>;
    template<class T> using max_queue = p_queue<T, less<T>>;

    template<class T> inline bool CHMIN(T& X, const T& A){ if(X > A) {X = A; return true;} return false; }
    template<class T> inline bool CHMAX(T& X, const T& A){ if(X < A) {X = A; return true;} return false; }

    ///----- vector I/O
    template<class T>
    vector<T> VEC(size_t n, T t){
        return vector<T>(n, t);
    }

    template<class ...Ts>
    auto VEC(size_t n, Ts ... ts){
        return vector<decltype(VEC(ts...))>(n, VEC(ts...));
    }

    template<class T>
    vector<T> VIN(istream& is, size_t n){
        vector<T> v(n);
        for (int i = 0; i < n; ++i) {
            is >> v[i];
        } // end i
        return v;
    }

    template<class T>
    auto VIN(istream& is, size_t n, size_t ts...){
        auto v = vector<decltype(VIN<T>(is, ts))>(n);
        for (auto &&x : v) {
            x = VIN<T>(is, ts);
        } // end x
        return v;
    }

    template<class T>
    bool VOUT(ostream& os, vector<T>& v){
        for (auto &&x : v) {
            os << x  << ' ';
        } // end x
        return !!os;
    }

    template<class T>
    bool VOUT(ostream& os, vector<vector<T>>& v, char endc = '\n'){
        for (auto &&vs : v) {
            VOUT(os, vs);
            os << endc;
        } // end vs
        return !!os;
    }

    ///----- tuple I/O
    template <class S, class T>
    istream& operator>>(istream& is, tuple<S, T>& t){
        return is >> get<0>(t) >> get<1>(t);
    }

    template <class S, class T, class U>
    istream& operator>>(istream& is, tuple<S, T, U>& t){
        return is >> get<0>(t) >> get<1>(t) >> get<2>(t);
    }

    template <class S, class T>
    ostream& operator<<(ostream& os, const tuple<S, T>& t){
        return os << get<0>(t) << ' ' <<  get<1>(t);
    }

    template <class S, class T, class U>
    ostream& operator<<(ostream& os, const tuple<S, T, U>& t){
        return os << get<0>(t) << ' ' <<  get<1>(t) << ' ' <<  get<2>(t);
    }

    ///----- constants
    constexpr i64 INFLL   = 1'000'000'000'000'000'020ll;
    constexpr i32 INF     = 1'000'000'009;
    constexpr f64 PI      = 3.14'159'265'358'979'323'846;
    constexpr f64 EPS     = 1e-12;
}
using namespace utils;


class solver{
    istream& is;
    ostream& os;

public:
    solver(istream& I, ostream& O) :is(I), os(O) {}

    int N;
    vector<ll> X, Y, P;
    bool input() {
        is >> N;
        X.resize(N);
        Y.resize(N);
        P.resize(N);
        for (int i = 0; i < N; ++i) {
            is >> X[i] >> Y[i] >> P[i];
        } // end i
        return !!is;
    }

    ll calc_cost(int x){
        ll min_cost = INFLL;
        for (int i = 0; i < N; ++i) {
            if(x & (1<<i)){
                ll rx = X[i];
                ll ry = Y[i];
                ll cost = 0;
                for (int j = 0; j < N; ++j) {
                    if(x & (1 << j) and i != j){
                        cost += P[j] * abs(X[j] - X[i]);
                    }
                } // end j
                CHMIN(min_cost, cost);
                cost = 0;
                for (int j = 0; j < N; ++j) {
                    if(x & (1 << j) and i != j){
                        cost += P[j] * abs(Y[j] - Y[i]);
                    }
                } // end j
                CHMIN(min_cost, cost);
            }
        } // end i
        return min_cost;
    }

    void run();
};

void solver::run(){
    if(!input()) return;

    vector<ll> cost(1<<N);
    for (int i = 0; i < cost.size(); ++i) {
        cost[i] = calc_cost(i);
    } // end i

    auto dp = VEC(1<<N, N+1, INFLL);
    for (int i = 0; i < dp.size(); ++i) {
        dp[i][0] = 0;
        for (int j = 0; j < N; ++j) {
            if(i & (1 << j) and i != j){
                dp[i][0] += P[j] * min(abs(X[j]), abs(Y[j]));
            }
        } // end j
    } // end i
    for (int j = 1; j <= N; ++j) {
        for (int i = 0; i < dp.size(); ++i) {
            int k = i;
            do{
                CHMIN(dp[i][j], dp[i-k][j-1] + cost[k]);
                k = (k-1) & i;
            }while(k != i);
        } // end i
    } // end j
    for (int i = 0; i <= N; ++i) {
        cout << dp.back()[i] << endl;
    } // end i
}

int main(int argc, char *argv[]) {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(16) << scientific;
#ifdef XELMH
    string test_cases = "test_E.txt";
    cerr << test_cases << " -->" << endl;
    auto fs = fstream(test_cases, fstream::in);
    int loop = 0;
    while(fs) {
        loop++;
        cout << '#' << loop << "#------\n";
        solver(fs, cout).run();
    }
    if(loop <= 1) {
        cout << "===" << endl;
        while(cin) solver(cin, cout).run();
    }
#else
    solver(cin, cout).run();
#endif
    return 0;
}


Measured memory_bytes: 9008