#include"stdio.h"
#include"vector"
#include"cmath"
#include"cassert"
#include"algorithm"
#define N 50
#define INF 1000000000 
using namespace std;
//long long abs(long long a) { return a>0 ? a: -a; }
struct point {
		int x, y, w;
		void read() {
				scanf("%d%d%d", &x, &y, &w);
		}
} pts[N];
long long area(int i, int j, int k) {
		return (pts[i].x - pts[k].x) * (long long) (pts[j].y - pts[i].y) - (pts[i].x - pts[j].x) * (long long) (pts[k].y - pts[i].y);
}
long long aarea(int i, int j, int k) {
		return abs(area(i, j, k));
}
int n;
int cost[N][N][N];
typedef int PATH;
PATH dp[N+1][N][N];
PATH ans[N+1];
int a, b;
int main () {
		scanf("%d", &n);
		for(int i=0; i<n; i++) {
				pts[i].read();
		}
		for(int i=0; i<n; i++)
				for(int j=i+1; j<n; j++)
						for(int k=j+1; k<n; k++) {
								cost[i][j][k] = 0;
								long long tot_area = aarea(i, j, k);
								for(int l=0; l<n; l++) {
										if(l==i || l==j || l==k) continue;
										if(aarea(i,l,j) + aarea(j,l,k) + aarea(k,l,i) == tot_area) {
												cost[i][j][k] += pts[l].w;
										}
								}
						}
		for(int i=0; i<n; i++)
				for(int j=0; j<n; j++)
						for(int k=0; k<n; k++) {
								vector<int> v{i, j, k};
								sort(v.begin(), v.end());
								cost[i][j][k] = cost[v[0]][v[1]][v[2]];
						}
		for(int i=0; i<=n; i++)
				ans[i] = INF;
		for(a=0; a<n; a++) {
				for(b=0; b<a; b++) {
						for(int l=1; l<=a+1; l++)
								for(int i=0; i<=a; i++)
										for(int j=0; j<=a; j++)
												dp[l][i][j] = INF;
						dp[1][a][b] = pts[b].w;
						for(int l=1; l<=a; l++)
								for(int p=0; p<=a; p++)
										for(int q=0; q<a; q++) {
												if(dp[l][p][q] >= INF) continue;
												for(int next=0; next<=a; next++) {
														if(area(p, q, next)<=0 || (next != a && (area(a, q, next)<=0 || area(a, b, next)<=0)))
																continue;
														if(next == a && area(q, a, b)<=0)
																continue;
														int candidate = cost[a][q][next] + pts[next].w + dp[l][p][q];
														dp[l+1][q][next] = min(dp[l+1][q][next], candidate);
														if(next==a) {
																ans[l+1] = min(ans[l+1], dp[l+1][q][a]);
														}
												}
										}
				}
		}
		for(int len=3; len<=n; len++) {
				int res = ans[len];
				printf("%d ", res>=INF ? -1 : res);
		}
}