//#define NDEBUG

#pragma region cp_template

#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

struct rep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
struct revrep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
  return a < b ? b - a : a - b;
}
template <class T> void chmin(T &a, const T &b) noexcept {
  if (b < a)
    a = b;
}
template <class T> void chmax(T &a, const T &b) noexcept {
  if (a < b)
    a = b;
}
template <class F> class rec_lambda {
  F f;

public:
  rec_lambda(F &&f) : f(std::move(f)) {}
  template <class... Args> auto operator()(Args &&... args) const {
    return f(*this, std::forward<Args>(args)...);
  }
};
template <class F> auto make_rec(F &&f) { return rec_lambda<F>(std::move(f)); }
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}
constexpr char eoln = '\n';
template <class T> T ceildiv(const T &l, const T &r) {
  return l / r + (l % r != 0 ? 1 : 0);
}

} // namespace n91

#pragma endregion cp_template

#include <algorithm>
#include <limits>
#include <numeric>


namespace n91 {

void main_() {
  /*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/
  const usize n = scan<usize>();
  std::vector<i64> x(n), y(n), p(n);
  for (const usize i : rep(0, n)) {
    std::cin >> x[i] >> y[i] >> p[i];
  }

  std::vector<usize> xs(n), ys(n);
  const auto set = [](std::vector<usize> &s, const std::vector<i64> &d) {
    std::iota(s.begin(), s.end(), 0);
    std::sort(s.begin(), s.end(), [&](auto l, auto r) { return d[l] < d[r]; });
  };
  set(xs, x);
  set(ys, y);
  std::vector<usize> rxs(xs.rbegin(), xs.rend());
  std::vector<usize> rys(ys.rbegin(), ys.rend());

  static constexpr i64 Inf = std::numeric_limits<i64>::max();

  std::vector<i64> base(n, Inf);
  for (const usize i : rep(0, n)) {
    chmin(base[i], difference<i64>(0, x[i]));
    chmin(base[i], difference<i64>(0, y[i]));
  }

  std::vector<i64> ans(n + 1, Inf);
  for (const auto s : rep(0, 1 << n)) {
    std::vector<i64> base2 = base;
    usize bpop = 0;
    for (const auto v : {&xs, &rxs}) {
      usize prev = n;
      for (const usize i : *v) {
        if (s >> i & 1) {
          prev = i;
          bpop += 1;
        }
        if (prev != n) {
          chmin(base2[i], difference(x[prev], x[i]));
        }
      }
    }

    const usize cop = ((1 << n) - 1) & ~s;
    usize t = cop;
    while (true) {
      std::vector<i64> cost = base2;
      usize pop = bpop;
      for (const auto v : {&ys, &rys}) {
        usize prev = n;
        for (const usize i : *v) {
          if (t >> i & 1) {
            prev = i;
            pop += 1;
          }
          if (prev != n) {
            chmin(cost[i], difference(y[prev], y[i]));
          }
        }
      }

      i64 csum = 0;
      for (const auto i : rep(0, n)) {
        csum += p[i] * cost[i];
      }
      chmin(ans[pop / 2], csum);

      if (t == 0) {
        break;
      }
      t = (t - 1) & cop;
    }
  }

  for (const auto e : ans) {
    std::cout << e << eoln;
  }
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}


Measured memory_bytes: 3640