### BUGGY CODE ###

import bisect
import copy
import heapq
import sys
import itertools
import math
from functools import lru_cache
from collections import deque
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7 

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]


class V:
    def __init__(self, f, v=None):
        self.f = f
        self.v = v
 
    def __str__(self):
        return str(self.v)
 
    def ud(self, n):
        if n is None:
            return

        if self.v is None:
            self.v = n
            return
        self.v = self.f(self.v, n) 


def main():
    N = int(input())
    P = read_lists(N)

    C = [10 ** 12] * (N + 1)
    CX = [[0] * N for _ in range(2 ** N)]
    CY = [[0] * N for _ in range(2 ** N)]
    SX = [{0} for _ in range(2 ** N)]
    SY = [{0} for _ in range(2 ** N)]
    for T in range(2 ** N):
        for i in range(N):
            if (T >> i) & 1:
                SX[T].add(P[i][0])
                SY[T].add(P[i][1])

        for j, (xp, yp, _) in enumerate(P):
            CX[T][j] = min(abs(xp - x) for x in SX[T])
            CY[T][j] = min(abs(yp - y) for y in SY[T])

    LX = [0] * (2 ** N)
    LY = [0] * (2 ** N)
    for i, (sx, sy) in enumerate(zip(SX, SY)):
        LX[i] = len(sx)
        LY[i] = len(sy)

    for T in itertools.product(range(3), repeat=N):
        tx = 0
        ty = 0
        for i, t in enumerate(T):
            if t == 1:
                tx |= (1 << i) 
            elif t == 2:
                ty |= (1 << i) 

        c = 0
        for n in range(N):
            c += min(CX[tx][n], CY[ty][n]) * P[n][2]
        p = LX[tx] + LY[ty] - 2
        C[p] = min(C[p], c)

    print("\n".join(map(str, C)))


if __name__ == "__main__":
    main()


### FIXED CODE ###

import bisect
import copy
import heapq
import sys
import itertools
import math
from functools import lru_cache
from collections import deque
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7 

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]


def main():
    N = int(input())
    P = read_lists(N)
    # N = 15
    # P = [(i ** 2 + 1, i ** 2 + 1, i ** 2 + 1) for i in range(N)]
    
    C = [1 << 62] * (N + 1)
    # CX = [None for _ in range(2 ** N)]
    # CY = [None for _ in range(2 ** N)]
    CX = [1 << 62] * (N * 2 ** N)
    CY = [1 << 62] * (N * 2 ** N)

    LX = [0] * (2 ** N)
    LY = [0] * (2 ** N)
    for K in range(2 ** N):
        X = {0}
        Y = {0}
        for i in range(N):
            if (K >> i) & 1:
                X.add(P[i][0])
                Y.add(P[i][1])
         
        # CXX = [0] * N
        # CYY = [0] * N
        for j, (xp, yp, cp) in enumerate(P):
            for x in X:
                # CXX[j] = min(abs(xp - x) * cp, CXX[j])
                CX[K * N + j] = min(abs(xp - x) * cp, CX[K * N + j])
            for y in Y:
                CY[K * N + j] = min(abs(yp - y) * cp, CY[K * N + j])
                # CYY[j] = min(abs(yp - y) * cp, CYY[j])
            
        LX[K] = len(X)
        LY[K] = len(Y)
        # CX[K] = tuple(CXX)
        # CY[K] = tuple(CYY)

    for T in range(2 ** N):
        p = format(T, "160b").count("1")
        if C[p] == 0:
            continue

        r = 1 << 62
        tx = T
        while True:
            ty = T - tx
            c = 0
            for n in range(N):
                c += min(CX[tx * N + n], CY[ty * N + n])
            r = min(r, c)
            if tx == 0:
                break
            tx = (tx - 1) & T
        C[p] = min(C[p], r)
    print("\n".join(map(str, C)))


if __name__ == "__main__":
    main()