#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <iomanip>

using namespace std;

#define DEBUG_ //!!$BDs=P;~$K%3%a%s%H%"%&%H(B!!
#ifdef DEBUG_
#define dump(x)  cerr << #x << " = " << (x) << endl;
#else
#define dump(x)  ;
#endif

#define equals(a,b) (fabs((a)-(b)) < EPS)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back

//#define int long long

typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

    template <typename T>
std::string printVector(const std::vector<T> &data)
{
    std::stringstream ss;
    std::ostream_iterator<T> out_it(ss, ", ");
    ss << "[";
    std::copy(data.begin(), data.end() - 1, out_it);
    ss << data.back() << "]";
    return ss.str();
}

template <typename T>
void print_array(const T &ary, int size){
    REP(i,size){
        cout << ary[i] << " ";
    }
    cout << endl;
}

const int mod = 1e9+7;
const LL LINF = 1001002003004005006ll;
const int INF = 1001001001;
const double EPS = (1e-10);
const long double PI = 3.14159265358979323846264338327950288419716939937510582097494459230781640628620899;
int dx[] = {0,0,-1,1};
int dy[] = {-1,1,0,0};


signed main(int argc, char const *argv[])
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(12);

    int N; cin >> N;
    VL X(N),Y(N),P(N);
    REP(i,N){
        cin >> X[i] >> Y[i] >> P[i];
    }
    VL cost(1<<N);
    REP(mask,(1<<N)){
        LL res = LINF;
        REP(i,N){
            LL acc = 0;
            REP(j,N){
                if((mask >> j) & 1) acc += abs(X[i] - X[j]) * P[j];
            }
            chmin(res, acc);
        }

        REP(i,N){
            LL acc = 0;
            REP(j,N){
                if((mask >> j) & 1) acc += abs(Y[i] - Y[j]) * P[j];
            }
            chmin(res, acc);
        }

        cost[mask] = res;
    }


    vector<VL> dp(1<<N, VL(N+2));
    REP(i,1<<N){
        LL acc = 0;
        REP(j,N){
            if((i >> j) & 1) acc += abs(X[j]) * P[j];
        }
        dp[i][0] = acc;
    }

    REP(i,1<<N){
        LL tmp = LINF;
        for(int j = i; j >= 0; j--){
            j &= i;
            LL acc = 0;
            REP(k,N){
                if((j >> k) & 1){
                    acc += abs(Y[k]) * P[k];
                }
            }
            chmin(tmp, acc + dp[i-j][0]);
        }
        dp[i][1] = tmp;
    }

    FOR(i,2,N+2){
        REP(j,1<<N){
            LL tmp = LINF;
            for(int k = j; k >= 0; k--){
                k &= j;
                chmin(tmp, cost[k] + dp[j-k][i-1]);
            }

            dp[j][i] = tmp;
        }
    }

    REP(i,N+1){
        cout << dp[(1<<N)-1][i+1] << endl;
    }
        

}

Measured memory_bytes: 8728