#include <stdio.h>
int n;
void run()
{
	int i,j,p,q,r,a[104][104],b[104],m,t;
	if(n==0)
		return;
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
			a[i][j]=9999;
	for(i=1;i<=n;i++)
		b[i]=0;
	b[1]=1;
	for(i=1;i<=n*(n-1)/2;i++)
	{
		scanf("%d%d%d",&p,&q,&r);
		a[p][q]=r;
		a[q][p]=r;
	}
	m=1;
	t=0;
	while(m<n)
	{
		r=0;
		for(i=1;i<=n;i++)
			if(b[i]==1)
				for(j=1;j<=n;j++)
					if(b[j]==0)
						if((r==0)||(a[p][q]>a[i][j]))
						{
							r=1;
							p=i;
							q=j;
						}
		if(r==1)
		{
			b[q]=1;
			m++;
			t+=a[p][q];
		}
	}
	printf("%d\n",t);
	return;
}
int main()
{
	n=1;
	while(n!=0)
	{
		scanf("%d",&n);
		run();
	}
	return 0;
}

/**************************************************************
	Problem: 2188
	User: admin
	Language: C++
	Result: Accepted
	Time:13 ms
	Memory:1144 kb
****************************************************************/