#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

int main() {
  int n;
  cin >> n;
  vector<int> x(n), y(n), c(n);
  for (int i = 0; i < n; ++i) {
    cin >> x[i] >> y[i] >> c[i];
  }
  vector<int64> ret(n + 1, 1LL << 60);
  vector<int> can, v(n);
  for (int S = 0; S < (1 << n); ++S) {
    can.clear();
    for (int i = 0; i < n; ++i) {
      if (!(S & (1 << i))) can.push_back(i);
    }
    for (int sX = S; ; sX = (sX - 1) & S) {
      for (auto& j : can) v[j] = min(abs(x[j]), abs(y[j]));
      int sY = S ^ sX;
      for (int i = 0; i < n; ++i) {
        if (sX & (1 << i)) {
          for (auto& j : can) {
            v[j] = min(v[j], abs(x[i] - x[j]));
          }
        } else if (sY & (1 << i)) {
          for (auto& j : can) {
            v[j] = min(v[j], abs(y[i] - y[j]));
          }
        }
      }
      int64 sum = 0;
      for (auto& j : can) sum += 1LL * c[j] * v[j];
      // trace(S, sum, can);
      int k = __builtin_popcount(S);
      ret[k] = min(ret[k], sum);
      if (sX == 0) break;
    }
  }
  for (int i = 0; i <= n; ++i) {
    cout << ret[i] << endl;
  }
  return 0;
}


Measured memory_bytes: 3168