# include <iostream>
# include <algorithm>
using namespace std;
int root[110] = {0};
typedef struct Node
{
int a;
int b;
int c;
}Node;
Node bian[5100];
bool comp(Node a,Node b)
{
return a.c<b.c;
}
int find(int a)
{
return root[a] == a?a : find(root[a]);
}
int main()
{
int n = 1;
int a,b,c;
int num = 0;
int sum;
int m = 0;
while(n!=0)
{
sum = 0;
num = 0;
scanf("%d",&n);
if(n == 0)
{
break;
}
m= n*(n-1)/2;
for(int i =1;i<=n;i++)
{
root[i] = i;
}
for(int i =1;i<=m;i++)
{
scanf("%d %d %d",&bian[i].a,&bian[i].b,&bian[i].c);
}
sort(bian+1,bian+1+m,comp);
for(int i =1;i<=m;i++)
{
if(find(bian[i].a) != find(bian[i].b))
{
sum+=bian[i].c;
root[find(bian[i].b)] = find(bian[i].a);
}
}
printf("%d\n",sum);
}
}