#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d)                                                     \
  vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N;
  cin >> N;
  vl X(N), Y(N), P(N);

  REP(i, N) { cin >> X[i] >> Y[i] >> P[i]; }
  vvl DPX = VVL(1 << N, N, llINF);
  vvl DPY = VVL(1 << N, N, llINF);

  REP(s, POW(2, N)) {

    REP(i, N) {
      ll scx = min(abs(X[i]), abs(Y[i]));
      ll scy = min(abs(X[i]), abs(Y[i]));
      ll po = s;
      REP(j, N) {
        if (po % 2 == 1) {
          scx = min(scx, abs(X[j] - X[i]));
          scy = min(scy, abs(Y[j] - Y[i]));
        }
        po /= 2;
      }
      DPX[s][i] = scx;
      DPY[s][i] = scy;
    }
  }
  vl ANS(N + 1, llINF);

  REP(s, POW(3, N)) {
    ll state_x = 0;
    ll state_y = 0;
    ll po = s;
    ll count = 0;
    REP(i, N) {
      if (po % 3 == 1) {
        state_x += POW(2, i);
        count++;
      } else if (po % 3 == 2) {
        state_y += POW(2, i);
        count++;
      }
      po /= 3;
    }

    ll score = 0;
    REP(i, N) { score += min(DPX[state_x][i], DPY[state_y][i]) * P[i]; }
    ANS[count] = min(ANS[count], score);
  }
  REP(i, N + 1) cout << ANS[i] << endl;
  // REP(i, N - min(N, M)) cout << 0 << endl;

  return 0;
}


Measured memory_bytes: 12968