/* 最小生成树 水题
*/
#include<cstdio>
#include<cstring>#include<cmath>
#define INF 1<<30
int n,m,vis[110];
int low[110];
int map[110][110];
int init()
{
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
map[i][j] = INF;
memset(vis,0,sizeof(vis));
}
double prim()
{
int ans=0;
for(int i = 0; i <= n; i++)
low[i] = map[1][i];
vis[1] = 1;
for(int i = 1; i < n; i++)
{
int temp=INF,pos=-1;
for(int j = 1; j <= n; j++)
if(temp>low[j]&&!vis[j])
{
temp = low[j];
pos = j;
}
if(pos==-1) return -1;
vis[pos]=1;
ans+=low[pos];
for(int j = 1; j <= n; j++)
if(!vis[j]&&low[j]>map[pos][j])
low[j] = map[pos][j];
}
return ans;
}
int main()
{
int t,a,b,c,d;
while(scanf("%d",&n),n)
{
init();
for(int i = 1; i <= n*(n-1)/2; i++)
{
scanf("%d %d %d %d",&a,&b,&c,&d);
if(!d)
map[a][b] = map[b][a] = c;
else map[a][b] = map[b][a] = 0;
}
int res = prim();
printf("%d\n",res);
}
return 0;
}