#line 1 "main.cpp"

/**
 * @title Template
 */

#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>

#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/chmin_chmax.cpp"

template <class T, class U>
constexpr bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) { 
    lhs = rhs; 
    return true; 
  }
  return false;
}

template <class T, class U>
constexpr bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) { 
    lhs = rhs; 
    return true; 
  }
  return false;
}

/**
 * @title Chmin/Chmax
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

#line 4 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

class range {
public:
  class iterator {
  private:
    int64_t M_position;

  public:
    constexpr iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { ++M_position; }
    constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };

  class reverse_iterator {
  private:
    int64_t M_position;
  
  public:
    constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { --M_position; }
    constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };
  
private:
  const iterator M_first, M_last;

public:
  constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { }
  constexpr iterator begin() const noexcept { return M_first; }
  constexpr iterator end() const noexcept { return M_last; }
  constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); } 
  constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); } 

};

/**
 * @title Range
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

#include <type_traits>
#include <iterator>
#line 6 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

template <class T>
class rev_impl {
public:
  using iterator = typename std::decay<T>::type::reverse_iterator;

private:
  const iterator M_begin;
  const iterator M_end;

public:
  constexpr rev_impl(T &&cont) noexcept: M_begin(std::rbegin(cont)), M_end(std::rend(cont)) { }
  constexpr iterator begin() const noexcept { return M_begin; }
  constexpr iterator end() const noexcept { return M_end; }

};

template <class T>
constexpr decltype(auto) rev(T &&cont) {
  return rev_impl<T>(std::forward<T>(cont));
}

/**
 * @title Reverser
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/bit_operation.cpp"

#include <cstddef>
#include <cstdint>

constexpr size_t bit_ppc(const uint64_t x) {
  return __builtin_popcountll(x);
}

constexpr size_t bit_ctzr(const uint64_t x) {
  return x == 0 ? 64 : __builtin_ctzll(x);
}

constexpr size_t bit_ctzl(const uint64_t x) {
  return x == 0 ? 64 : __builtin_clzll(x);
}

constexpr size_t bit_width(const uint64_t x) { 
  return 64 - bit_ctzl(x);
}

constexpr uint64_t bit_msb(const uint64_t x) {
  return x == 0 ? 0 : uint64_t(1) << (bit_width(x) - 1);
}

constexpr uint64_t bit_lsb(const uint64_t x) {
  return x & (-x);
}

constexpr uint64_t bit_cover(const uint64_t x) {
  return x == 0 ? 0 : bit_msb(2 * x - 1);
}

constexpr uint64_t bit_rev(uint64_t x) {
  x = ((x >> 1) & 0x5555555555555555) | ((x & 0x5555555555555555) << 1);
  x = ((x >> 2) & 0x3333333333333333) | ((x & 0x3333333333333333) << 2);
  x = ((x >> 4) & 0x0F0F0F0F0F0F0F0F) | ((x & 0x0F0F0F0F0F0F0F0F) << 4);
  x = ((x >> 8) & 0x00FF00FF00FF00FF) | ((x & 0x00FF00FF00FF00FF) << 8);
  x = ((x >> 16) & 0x0000FFFF0000FFFF) | ((x & 0x0000FFFF0000FFFF) << 16);
  x = (x >> 32) | (x << 32);
  return x;
}

/**
 * @title Bit Operations
 */
#line 18 "main.cpp"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;

constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;

std::vector<i64> solve(const std::vector<std::pair<i32, i32>> &left, const std::vector<std::pair<i32, i32>> &right) {
  i32 L = left.size(), R = right.size();
  std::vector<i64> res(L + R + 1, inf64);
  std::vector<i32> lx(L + 2), rx(R + 2);
  lx.front() = -20000;
  lx.back() = 0;
  rx.front() = 0;
  rx.back() = 20000;
  for (auto i: range(0, L)) {
    lx[i + 1] = left[i].first;
  }
  for (auto i: range(0, R)) {
    rx[i + 1] = right[i].first;
  }
  for (auto S: range(0, 1 << L)) {
    for (auto T: range(0, 1 << R)) {
      i64 sum = 0;
      {
        auto set = (1 << 0) | (S << 1) | (1 << (L + 1));
        i32 l = 0, r = 0;
        for (auto i: range(1, L + 1)) {
          if (set >> i & 1) {
            l = i;
          }
          if (r < i) {
            r = i;
            while (!(set >> r & 1)) {
              ++r;
            }
          }
          sum += (i64) left[i - 1].second * std::min(left[i - 1].first - lx[l], lx[r] - left[i - 1].first);
          assert(lx[l] <= left[i - 1].first && left[i - 1].first <= lx[r]);
        }
      }
      {
        auto set = (1 << 0) | (T << 1) | (1 << (R + 1));
        i32 l = 0, r = 0;
        for (auto i: range(1, R + 1)) {
          if (set >> i & 1) {
            l = i;
          }
          if (r < i) {
            r = i;
            while (!(set >> r & 1)) {
              ++r;
            }
          }
          sum += (i64) right[i - 1].second * std::min(right[i - 1].first - rx[l], rx[r] - right[i - 1].first);
          assert(rx[l] <= right[i - 1].first && right[i - 1].first <= rx[r]);
        }
      }
      chmin(res[bit_ppc(S) + bit_ppc(T)], sum);
    }
  }
  return res;
}

std::vector<std::vector<i64>> enumerate(const std::vector<i32> &L, const std::vector<i32> &C) {
  i32 N = L.size();
  std::vector<std::vector<i64>> res(1 << N);
  for (auto S: range(0, 1 << N)) {
    std::vector<std::pair<i32, i32>> left, right;
    for (auto i: range(0, N)) {
      if (S >> i & 1) {
        (L[i] < 0 ? left : right).emplace_back(L[i], C[i]);
      }
    }
    std::sort(left.begin(), left.end());
    std::sort(right.begin(), right.end());
    res[S] = solve(left, right);
  }
  return res;
}

int main() {
  i32 N;
  std::cin >> N;
  std::vector<i32> X(N), Y(N), P(N);
  for (auto i: range(0, N)) {
    std::cin >> X[i] >> Y[i] >> P[i];
  }
  auto scoreX = enumerate(X, P);
  auto scoreY = enumerate(Y, P);
  std::vector<i64> ans(N + 1, inf64);
  for (auto S: range(0, 1 << N)) {
    auto T = ((1 << N) - 1) & (~S);
    for (auto i: range(0, bit_ppc(S) + 1)) {
      for (auto j: range(0, bit_ppc(T) + 1)) {
        chmin(ans[i + j], scoreX[S][i] + scoreY[T][j]);
      }
    }
  }
  for (auto x: ans) {
    std::cout << x << '\n';
  }
  return 0;
}


Measured memory_bytes: 9844