#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

int main() {
  int N;
  cin >> N;
  vector< int > X(N), Y(N), P(N);
  for(int i = 0; i < N; i++) {
    cin >> X[i] >> Y[i] >> P[i];
  }
  vector< int > ys{Y};
  ys.emplace_back(-inf);
  ys.emplace_back(inf);
  ys.emplace_back(0);
  sort(begin(ys), end(ys));
  ys.erase(unique(begin(ys), end(ys)), end(ys));
  vector< int64 > ans(N + 1, infll);
  for(int i = 0; i < (1 << N); i++) {
    vector< int > ns(N, inf);
    for(int k = 0; k < N; k++) {
      chmin(ns[k], abs(X[k]));
    }
    for(int j = 0; j < N; j++) {
      if((i >> j) & 1) {
        for(int k = 0; k < N; k++) {
          chmin(ns[k], abs(X[j] - X[k]));
        }
      }
    }
    auto dp = make_v< int64 >(ys.size(), N + 1);
    fill_v(dp, infll);
    dp[0][__builtin_popcount(i)] = 0;
    for(int j = 0; j < ys.size(); j++) { // 直前の場所
      for(int k = j + 1; k < ys.size(); k++) { // 次の場所
        for(int l = 0; l <= N; l++) { // とった個数
          int64 cost = 0;
          for(int m = 0; m < N; m++) {
            if(ys[j] < Y[m] && Y[m] <= ys[k]) {
              cost += 1LL * min({Y[m] - ys[j], ys[k] - Y[m], ns[m]}) * P[m];
            }
          }
          int nx = l + (ys[k] != inf && ys[k] != 0);
          if(nx <= N) {
            chmin(dp[k][nx], dp[j][l] + cost);
          }
        }
      }
    }
    for(int j = 0; j <= N; j++) chmin(ans[j], dp[ys.size() - 1][j]);
  }

  for(auto &p : ans) cout << p << "\n";
}



Measured memory_bytes: 3636