#include<iostream>
#include<cstdio>
#include<queue>
#define N 2000
#define M 2500000
#define inf 1e9
using namespace std;
int read()
{
    char c=0;
    int sum=0,f=1;
    while (c!='-'&&(c<'0'||c>'9')) c=getchar();
    if (c=='-') c=getchar(),f=-1;
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum*f;
}
struct node
{
    int v,data,nxt;
};
node edge[M+1];
struct reads
{
    int x,y,r,s;
};
reads st[N+1];
int T,n,len,s,t,ans,head[N+1],cur[N+1],depth[N+1];
void add(int x,int y,int z)
{
    edge[++len]=(node){y,z,head[x]},head[x]=len;
    edge[++len]=(node){x,0,head[y]},head[y]=len;
    return;
}
bool bfs()
{
    int top;
    queue<int>q;
    for (int i=s;i<=t;++i) depth[i]=0;
    q.push(s),depth[s]=1;
    while (!q.empty())
    {
	top=q.front(),q.pop();
	for (int i=head[top];i>0;i=edge[i].nxt)
	    if (edge[i].data&&!depth[edge[i].v])
		depth[edge[i].v]=depth[top]+1,q.push(edge[i].v);
    }
    return depth[t]>0;
}
int dinic(int x,int flow)
{
    if (x==t) return flow;
    int k;
    for (int &i=cur[x];i>0;i=edge[i].nxt)
	if (edge[i].data&&depth[edge[i].v]==depth[x]+1)
	{
	    k=dinic(edge[i].v,min(flow,edge[i].data));
	    if (k)
	    {
		edge[i].data-=k,edge[i^1].data+=k;
		return k;
	    }
	}
    return 0;
}
int main()
{
    int flow;
    T=read();
    for (int qt=1;qt<=T;++qt)
    {
	n=read(),s=0,t=n+1,len=1,ans=0;
	for (int i=s;i<=t;++i) head[i]=0;
	for (int i=1;i<=n;++i) st[i].x=read(),st[i].y=read(),st[i].r=read(),st[i].s=read();
	for (int i=1;i<=n;++i)
	{
	    if (st[i].s>0) add(s,i,st[i].s),ans+=st[i].s;
	    if (st[i].s<0) add(i,t,-st[i].s);
	}
	for (int i=1;i<=n;++i)
	    for (int j=1;j<=n;++j)
		if (i!=j)
		    if ((st[i].x-st[j].x)*(st[i].x-st[j].x)+(st[i].y-st[j].y)*(st[i].y-st[j].y)<=st[i].r*st[i].r)
			add(i,j,inf);
	while (bfs())
	{
	    for (int i=s;i<=t;++i) cur[i]=head[i];
	    while (flow=dinic(s,inf)) ans-=flow;
	}
	printf("Case #%d: %d\n",qt,ans);
    }
    return 0;
}