//c++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <climits>
#include <fstream>
#include <random>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
//typedef pair<ll, ll> P;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define revrep(i, n) for(int i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
#define chmin(x, y) x = min(x, y);
#define chmax(x, y) x = max(x, y);
#define len(x) ((int)(x).size())

//const ll INFL = LLONG_MAX;//10^18 = 2^60
const ll INFL = 1LL<<60;
//const int INF = INT_MAX;
const int INF = 1 << 30;//10^9
const ll MOD = 1000000007;
//const ll MOD = 998244353;
double EPS = 1e-10;

vector<ll> dy = {0, 1, 0, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0};

void pres(double A){printf("%.9lf\n", A);}
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}
ll cnt_bit(ll x){return __builtin_popcountll(x);}

ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x; k /= 2;
  }
  return res;
}

ll pow_mod(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}

ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll x, ll y){
  ll res = x / gcd(x, y);
  res *= y;
  return res;
};


//コンビネーション
const int MAXcomb = 2000010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAXcomb; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
ll comb(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}


ll disit(ll s, ll base = 10){
  ll res = 0;
  while(s){
    res++;
    s /= base;
  }
  return res;
}

int N;
vector<ll> X, Y, P;
ll ans[20];
ll Cost[20][20];
ll sum[20][20];
ll dp[20][20];

vector<ll> subsolve(vector<pair<ll, ll>>& x){
  x.pb({0, INF});
  sort(x.begin(), x.end());
  int n = x.size();
  rep(i, n){
    sum[i][0] = 0;
    rep(j, n) sum[i][j+1] = sum[i][j] + abs(x[i].f - x[j].f) * x[j].s;
  }
  rep(i, 20)rep(j, 20) Cost[i][j] = INFL;
  rep(i, n)rep(j, n)if(i <= j){
    rep(k, n){
      Cost[i][j] = min(Cost[i][j], sum[k][j+1] - sum[k][i]);
    }
  }
  rep(i, 20)rep(j, 20) dp[i][j] = INFL;
  dp[0][0] = 0;
  rep(i, n){
    rep(j, n){
      for(int k = i; k < n; k++){
        dp[k+1][j+1] = min(dp[k+1][j+1], dp[i][j] + Cost[i][k]);
      }
    }
  }
  vector<ll> res(n);
  rep(i, n){
    res[i] = dp[n][i+1];
  }
  return res;
}


void solve(){
  cin >> N;
  int M = N;
  rep(i, N){
    int a, b, c;
    cin >> a >> b >> c;
    if(a == 0 || b == 0) continue;
    X.pb(a);
    Y.pb(b);
    P.pb(c);
  }
  N = X.size();
  rep(i, N) ans[i] = INFL;
  rep(i, 1<<N){
    vector<pair<ll, ll>> x, y;
    rep(j, N){
      if((i>>j)&1){
        x.pb({X[j], P[j]});
      }else{
        y.pb({Y[j], P[j]});
      }
    }
    vector<ll> cost_x = subsolve(x);
    vector<ll> cost_y = subsolve(y);
    rep(j, int(cost_x.size())){
      rep(k, int(cost_y.size())){
        ans[j+k] = min(ans[j+k], cost_x[j] + cost_y[k]);
      }
    }
  }
  rep(i, M+1){
    cout << ans[i] << endl;
  }
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
}


Measured memory_bytes: 3648