#include <bits/stdc++.h>
using namespace std;

#define llong long long 
#define len(x) ((int)x.size())
#define rep(i,n) for (int i = -1; ++ i < n; )
#define rep1(i,n) for (int i = 0; i ++ < n; )
#define rand __rand
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());  // or mt19937_64
template<class T = int> T rand(T range = numeric_limits<T>::max()) { return (T)(rng() % range); }

#define CONCAT_(x, y) x##y/*{{{*/
#define CONCAT(x, y) CONCAT_(x, y)
#ifdef LOCAL_DEBUG   
int __db_level = 0;
bool __db_same_line = false;
#define clog cerr << string(!__db_same_line ? __db_level * 2 : 0, ' ')
struct debug_block {
    function<void()> fn;
    void print_name() { __db_same_line = true; fn(); clog << endl; __db_same_line = false;  }
    debug_block(function<void()> fn_): fn(fn_) { clog << "{ "; print_name(); ++__db_level; }
    ~debug_block() { --__db_level; clog << "} "; print_name(); }
};
#define DB(args...) debug_block CONCAT(dbbl, __LINE__)([=]{ clog << args; })
#define deb(...)  if (1) { (clog << "[" #__VA_ARGS__ "] = [" << __VA_ARGS__) << "]"; if (!__db_same_line) clog << endl; }
#else
#define clog if (0) cerr
#define DB(...)
#define deb(...)
#endif
template<class T>
ostream& operator,(ostream& out, const T& thing) { return out << ", " << thing; }
template<class U, class V>
ostream& operator<<(ostream& out, const pair<U, V>& p) { return (out << "(" << p.first, p.second) << ")"; }
template<class A, class B>
ostream& operator<<(ostream& out, const tuple<A, B>& t) { return (out << "(" << get<0>(t), get<1>(t)) << ")"; }
template<class A, class B, class C>
ostream& operator<<(ostream& out, const tuple<A, B, C>& t) { return (out << "(" << get<0>(t), get<1>(t), get<2>(t)) << ")"; }
template<class T> ostream& operator<<(ostream& out, const vector<T>& container) { 
    out << "{";
    if (len(container)) out << container[0];
    rep1(i, len(container) - 1) out, container[i];
    return out << "}";
}
template<class x> vector<typename x::value_type> $v(const x& a) { return vector<typename x::value_type>(a.begin(), a.end()); }
#define ptrtype(x) typename iterator_traits<x>::value_type
template<class u> vector<ptrtype(u)> $v(u a, u b) { return vector<ptrtype(u)>(a, b); }/*}}}*/
// ACTUAL SOLUTION BELOW ////////////////////////////////////////////////////////////

const int maxn = 20;
const llong inf = (llong)(1e16);
int n;
llong x[maxn], y[maxn], p[maxn];

llong ans[maxn];

void brute(int limit, int i, vector<llong> min_dist, int cnt, vector<pair<int, vector<llong>>>& res) {
    if (i == limit) {
        res.emplace_back(cnt, min_dist);
        return ;
    }
    
    brute(limit, i + 1, min_dist, cnt, res);
    
    auto min_dist_2 = min_dist;
    rep(f, n) {
        min_dist[f] = min(min_dist[f], abs(x[i] - x[f]));
        min_dist_2[f] = min(min_dist_2[f], abs(y[i] - y[f]));
    }
    
    brute(limit, i + 1, min_dist, cnt  + 1, res);
    brute(limit, i + 1, min_dist_2, cnt + 1, res);
}

int main(void) {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cin >> n;
    rep(i, n) cin >> x[i] >> y[i] >> p[i];
    
    vector<llong> min_dist;
    rep(i, n) min_dist.push_back(min(abs(x[i]), abs(y[i])));
    
    vector<pair<int, vector<llong>>> ans1, ans2;
    
    brute((n + 1) / 2, 0, min_dist, 0, ans1);
    brute(n, (n + 1) / 2, min_dist, 0, ans2);
    
    fill(ans, ans + maxn, inf);
    for (auto& [cnt1, md1]: ans1) {
        for (auto& [cnt2, md2]: ans2) {
            int s = cnt1  + cnt2;
            
            llong cur_ans = 0;
            rep(i, n) cur_ans += min(md1[i], md2[i]) * p[i];
            ans[s] = min(ans[s], cur_ans);
        }
    }
    
    rep(i, n + 1) cout << ans[i] << '\n';

    return 0;
}

// Remember:
// - Multitest? REFRESHING the data!!!
// - Constrains for each set of data may differs. Should NOT USE the same max constant (maxn)
//   for all of them.
// vim: foldmethod=marker


Measured memory_bytes: 4848