#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
struct road{
    int from;
    int to;
    int value;
};
vector<road> v;
int cmp(road a,road b){
    return a.value<b.value;
}
int f[105];
int find(int x){
    if(f[x]==x) return x;
    return find(f[x]);
}
int merge(int x,int y){
    int fx=find(x);
    int fy=find(y);
    if(fx!=fy){
        f[fy]=fx;
        return 1;
    }
    return 0;
}
int main()
{
    int n,x,y,z,c,sum;
    while(cin>>n){
        if(n==0) break;
        road e;
        c=0;
        sum=0;
        for(int i=0;i<=n;i++) f[i]=i;
        for(int i=0;i<n*(n-1)/2;i++){
            cin>>e.from>>e.to>>e.value;
            v.push_back(e);
        }
        sort(v.begin(),v.end(),cmp);
        for(int i=0;i<v.size();i++){
            if(merge(v[i].from,v[i].to)){
                c++;
                sum+=v[i].value;
            }
            if(c==n-1) break;
        }
        cout<<sum<<endl;
        v.clear();
    }
    return 0;
}