using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;
using System.Runtime.InteropServices.ComTypes;
using System.Data.SqlTypes;
using System.Numerics;

internal partial class Solver {
    public void Run() {
        var n = ni();
        var x = new int[n];
        var y = new int[n];
        var p = new int[n];

        for (int i = 0; i < n; i++) {
            x[i] = ni();
            y[i] = ni();
            p[i] = ni();
        }

        var ans = E.Repeat(long.MaxValue, n + 1).ToArray();

        long[] cost = new long[n];
        for (int i = 0; i < n; i++) {
            cost[i] = Math.Min(Math.Abs(x[i]), Math.Abs(y[i]));
        }
        var table = Enumerable.Range(0, n).Select(_ => new long[n]).ToArray();
        void dfs(int pos, int k, long[] currentCost) {
            if (pos == n) {
                //check
                long sub = 0;
                for (int i = 0; i < n; i++) {
                    sub += currentCost[i] * p[i];
                }
                ans[k] = Math.Min(ans[k], sub);
                return;
            }
            dfs(pos + 1, k, currentCost); // 0
            var next = table[pos];
            Array.Copy(currentCost, next, next.Length);
            for (int i = 0; i < n; i++) {
                next[i] = Math.Min(next[i], Math.Abs(x[pos] - x[i]));
            }
            dfs(pos + 1, k + 1, next);
            Array.Copy(currentCost, next, next.Length);
            for (int i = 0; i < n; i++) {
                next[i] = Math.Min(next[i], Math.Abs(y[pos] - y[i]));
            }
            dfs(pos + 1, k + 1, next);
        }

        dfs(0, 0, cost);

        cout.WriteLine(ans.JoinToString("\n"));
    }

    public static ulong NextPermutationBit(ulong x) {
        if (x == 0) {
            return 0;
        }

        ulong rightOne = (ulong)((long)x & -(long)x);
        ulong nextHigherOneBit = x + rightOne;
        return nextHigherOneBit | ((x ^ nextHigherOneBit) / rightOne) >> 2;
    }

    private static IEnumerable<ulong> EnumerateFlags(int n, int k) {
        ulong x = (1UL << k) - 1;
        ulong max = 1UL << n;
        while (x < max) {
            yield return x;
            x = NextPermutationBit(x);
            if (x == 0) {
                yield break;
            }
        }
    }
}

// PREWRITEN CODE BEGINS FROM HERE

static public class StringExtensions {
    static public string JoinToString<T>(this IEnumerable<T> source, string separator = " ") {
        return string.Join(separator, source);
    }
}

internal partial class Solver : Scanner {
    public static void Main() {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
    private readonly TextWriter cerr;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
        cerr = Console.Error;
    }

    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

#if DEBUG
internal static class LinqPadExtension {
    public static string TextDump<T>(this T obj) {
        if (obj is IEnumerable) return (obj as IEnumerable).Cast<object>().JoinToString().Dump();
        else return obj.ToString().Dump();
    }
    public static T Dump<T>(this T obj) {
        return LINQPad.Extensions.Dump(obj);
    }
}
#endif

public class Scanner {
    private readonly TextReader Reader;
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    private readonly char[] buffer = new char[2 * 1024];
    private int cursor = 0, length = 0;
    private string Token;
    private readonly StringBuilder sb = new StringBuilder(1024);

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return checked((int)NextLong()); }
    public long NextLong() {
        var s = Next();
        long r = 0;
        int i = 0;
        bool negative = false;
        if (s[i] == '-') {
            negative = true;
            i++;
        }
        for (; i < s.Length; i++) {
            r = r * 10 + (s[i] - '0');
#if DEBUG
            if (!char.IsDigit(s[i])) throw new FormatException();
#endif
        }
        return negative ? -r : r;
    }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (Token == null) {
            if (!StockToken()) {
                throw new Exception();
            }
        }
        var token = Token;
        Token = null;
        return token;
    }

    public bool HasNext() {
        if (Token != null) {
            return true;
        }

        return StockToken();
    }

    private bool StockToken() {
        while (true) {
            sb.Clear();
            while (true) {
                if (cursor >= length) {
                    cursor = 0;
                    if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
                        break;
                    }
                }
                var c = buffer[cursor++];
                if (33 <= c && c <= 126) {
                    sb.Append(c);
                } else {
                    if (sb.Length > 0) break;
                }
            }

            if (sb.Length > 0) {
                Token = sb.ToString();
                return true;
            }

            return false;
        }
    }
}

Measured memory_bytes: 26960