#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
struct cum{
int a;
int b;
int w;
}s[10000];
int fa[10000];
bool cmp(cum x,cum y){
return x.w<y.w;
}
int find(int x){
if(x!=fa[x]) fa[x] = find(fa[x]);
return fa[x];
}
void bing(int x,int y){
int fx=find(x);
int fy=find(y);
if(fx!=fy){
fa[fx]=fy;
}
}
int main(){
int n;
int m;
while(scanf("%d",&n)==1&&n){
m=n*(n-1)/2;
for(int i=0;i<10000;i++){
fa[i]=i;
}
for(int i=0;i<m;i++){
scanf("%d%d%d",&s[i].a,&s[i].b,&s[i].w);
}
sort(s,s+m,cmp);
int cnt = 0;
for(int i=0;i<m;i++){
if(find(s[i].a)!=find(s[i].b)){
cnt+=s[i].w;
bing(s[i].a,s[i].b);
}
}
printf("%d\n",cnt);
}
return 0;
}