#pragma region header
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#define rep2(i, a, b) for (auto i = (a); i < (b); i++)
#define rrep2(i, a, b) for (auto i = b - 1; i >= a; i--)
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep2, rep1) (__VA_ARGS__)
#define rrep(...) GET_MACRO(__VA_ARGS__, rrep2, rrep1) (__VA_ARGS__)
#define each(i, a) for (auto &&i : (a))
using namespace std;

using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using vvs = vector<vs>;
using vd = vector<ld>;
using vvd = vector<vd>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using vp = vector<pii>;
using vvp = vector<vp>;
using mii = map<int, int>;
using vm = vector<mii>;
using vvm = vector<vm>;
template <class T, class U>
using umap = unordered_map<T, U>;
using umii = umap<int, int>;
using seti = set<int>;
template <class T>
using uset = unordered_set<T>;
using useti = uset<int>;
template <class T>
using less_queue = priority_queue<T>;
template <class T>
using greater_queue = priority_queue<T, vector<T>, greater<T>>;

constexpr int INF = 1e18;

template <class T>
void SORT(T &a) { stable_sort(all(a)); }
template <class T>
void RSORT(T &a) { stable_sort(rall(a)); }
template <class T>
void rev(T &a) { reverse(rall(a)); }
template <class T>
void uniq(T &a) { a.erase(unique(all(a)), end(a)); }
template <class T>
auto min_of(T a) { return *min_element(all(a)); }
template <class T>
auto max_of(T a) { return *max_element(all(a)); }
template <class T>
int sum_of(T a) { return accumulate(all(a), 0ll); }
template <class T, class U>
auto sum_of(T a, U init) { return accumulate(all(a), init); }
template <class T, class U>
int count_of(T a, U i) { return count(all(a), i); }
template <class T, class U>
bool has(T a, U i) { return find(all(a), i) != end(a); }
template <class T>
int sz(T a) { return a.size(); };

template <class T>
void COUT(T x) { cout << x << endl; }
template <class T, class U>
void COUT(T x, U y) { cout << x << ' ' << y << endl; }
template <class T, class U, class V>
void COUT(T x, U y, V z) { cout << x << ' ' << y << ' ' << z << endl; }
template <class T>
void CSP(T x) { cout << x << ' '; }
template <class T>
void CVEC(T v) {
  int c = v.size() - 1;
  for (size_t i = 0; i < c; i++) cout << v[i] << ' ';
  if (c > -1) cout << v[c];
  cout << endl;
}

template <class T>
bool amin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
bool amax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

int ceil_div(int x, int y) { return (x - 1) / y + 1; }

#pragma endregion header

void recursive_comb(int *nums, int s, int rest, std::function<void(int *)> f) {
  if (rest == 0) {
    f(nums);
  } else {
    if (s < 0) return;
    recursive_comb(nums, s - 1, rest, f);
    nums[rest - 1] = s;
    recursive_comb(nums, s - 1, rest - 1, f);
  }
}
void each_comb(int n, int k, std::function<void(int *)> f) {
  int nums[k];
  recursive_comb(nums, n - 1, k, f);
}
// each_comb(n, k, [&](int *nums) {});

void solve(int N, vi x, vi y, vi p) {
  vvi xmins(1ll << N, vi(N)), ymins(1ll << N, vi(N));
  for (int bits_i = 0; bits_i < (1ll << N); bits_i++) {
    seti xs, ys;
    xs.insert(0);
    ys.insert(0);
    xs.insert(INF);
    ys.insert(INF);
    xs.insert(-INF);
    ys.insert(-INF);
    for (int bit = 0; bit < N; bit++)
      if (bits_i & (1ll << bit)) {
        xs.insert(x[bit]);
        ys.insert(y[bit]);
      }
    rep(i, N) {
      int z = INF;
      auto it = xs.lower_bound(x[i]);
      amin(z, *it - x[i]);
      it--;
      amin(z, x[i] - *it);
      xmins[bits_i][i] = z * p[i];
    }
    rep(i, N) {
      int z = INF;
      auto it = ys.lower_bound(y[i]);
      amin(z, *it - y[i]);
      it--;
      amin(z, y[i] - *it);
      ymins[bits_i][i] = z * p[i];
    }
  }
  rep(k, N) {
    int ans = INF;
    each_comb(N, k, [&](int *nums) {
      for (int bits_i = 0; bits_i < (1ll << k); bits_i++) {
        int sum = 0;
        int bits_x = 0, bits_y = 0;
        rep(i, k) {
          int ni = nums[i];
          if (bits_i & (1ll << i))bits_x |= (1ll << ni);
          else bits_y |= (1ll << ni);
        }
        rep(i, N) sum += min(xmins[bits_x][i], ymins[bits_y][i]);
        amin(ans, sum);
      }
    });
    COUT(ans);
  }
  COUT(0);
}


#pragma region main
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(15);

  int n;
  cin >> n;
  vi x(n);
  vi y(n);
  vi p(n);
  for(int i = 0 ; i < n ; i++){
    cin >> x[i];
    cin >> y[i];
    cin >> p[i];
  }
  solve(n, move(x), move(y), move(p));
}
#pragma endregion main


Measured memory_bytes: 12968