1 #include <stdio.h>
 2 #include <string.h>
 3 #include <algorithm>
 4 #define LL long long
 5 using namespace std;
 6 
 7 const int MAX = 5000;
 8 
 9 int vis[128];
10 struct POINT{
11     int a, b, s;
12 };
13 
14 
15 int Find(int a)
16 {
17     if(a != vis[a])
18         vis[a] = Find(vis[a]);
19     return vis[a];
20 }
21 bool Union(int a, int b)
22 {
23     int aa = Find(a), bb = Find(b);
24     if(aa == bb)
25     {
26         return false;
27     }
28     vis[bb] = aa;
29     return true;
30 }
31 
32 bool cmp(POINT a, POINT b)
33 {
34     return a.s < b.s;
35 }
36 
37 POINT arr[5000];
38 
39 int main()
40 {
41 #ifdef CDZSC_OFFLINE
42     freopen("in.txt", "r", stdin);
43     freopen("out.txt", "w", stdout);
44 #endif
45     int n, m;
46     LL sum;
47     while(~scanf("%d", &n) && n)
48     {
49         m = (n * (n - 1)) >> 1;
50         memset(arr, 0, sizeof(arr));
51         for(int i = 0; i < 128; i++)
52         {
53             vis[i] = i;
54         }
55         for(int i = 0; i < m; i++)
56         {
57             scanf("%d%d%d", &arr[i].a, &arr[i].b, &arr[i].s);
58         }
59         sort(arr, arr + m, cmp);
60         sum = 0;
61         for(int i = 0; i < m; i++)
62         {
63             if(Union(arr[i].a, arr[i].b))
64             {
65                 sum += arr[i].s;
66             }
67         }
68         printf("%I64d\n", sum);
69     }
70     return 0;
71 }