#include <iostream>#include <algorithm>// 刚刚考完计算机组成,赶快做一道题��// 连续好几道 Kruskal,代码几乎都不用改(感谢老师��)//usingstd::cin;
usingstd::cout;
usingstd::endl;
constint N = 200;
intset[N];
int find_f(int x) {
if (x != set[x])
set[x] = find_f(set[x]);
returnset[x];
}
struct edge {
int x, y, v;
} e[N*(N - 1) / 2];
inlineint cmp(edge e1, edge e2) {
return e1.v<e2.v;
}
int main() {
int n;
while (cin >> n && n) {
for (int i = 0; i <= n; ++i)
set[i] = i;
n = n * (n - 1) / 2;
for (int i = 0; i<n; i++)
cin >> e[i].x >> e[i].y >> e[i].v;
std::sort(e, e + n, cmp);
int ans = 0;
for (int i = 0; i < n; ++i) {
int x = find_f(e[i].x);
int y = find_f(e[i].y);
if (x != y) {
ans += e[i].v;
set[x] = y;
}
}
cout << ans << endl;
}
return0;
}