#include<queue>
#include<cstdio>
using namespace std;
priority_queue<long long,vector<long long>,less<long long> >zhea,zheb;
priority_queue<long long,vector<long long>,greater<long long> >fua,fub;
long long t,n,sr,zera,zerb;long long sum;
int main()
{
	scanf("%d",&t);
	for(int ss=1;ss<=t;ss++)
	{
		scanf("%lld",&n),sum=0;
		for(int i=1;i<=n;i++)
		{
			scanf("%lld",&sr);
			if(sr<0) fua.push(sr);
			else if(sr>0) zhea.push(sr);
			else zera++;
		}
		for(int i=1;i<=n;i++)
		{
			scanf("%lld",&sr);
			if(sr<0) fub.push(sr);
			else if(sr>0) zheb.push(sr);
			else zerb++;
		}
		while((!fua.empty())&&(!zheb.empty()))
		{
			long long a=fua.top(),b=zheb.top();
			fua.pop(),zheb.pop(),sum+=a*b;
		}
		while((!zhea.empty())&&(!fub.empty()))
		{
			long long a=zhea.top(),b=fub.top();
			zhea.pop(),fub.pop(),sum+=a*b;
		}
//		1.fua+zhea+zerb
//		2.fua+fub(+zerb)(+zera)
		while(zera>0)
		{
			long long fu=(fub.empty()?0:-fub.top()),
			zhe=(zheb.empty()?0:zheb.top());
			if(fu>zhe) zera--,fub.pop();
			else if(fu<zhe||fu==zhe&&fu!=0)
			zera--,zheb.pop();
		}
		while(zerb>0)
		{
			long long fu=(fua.empty()?0:-fua.top()),
			zhe=(zhea.empty()?0:zhea.top());
			if(fu>zhe) zerb--,fua.pop();
			else if(fu<zhe||fu==zhe&&fu!=0)
			zerb--,zhea.pop();
		}
		while(!fua.empty()) sum+=fua.top()
		*fub.top(),fua.pop(),fub.pop();
		while(!zhea.empty()) sum+=zhea.top()
		*zheb.top(),zhea.pop(),zheb.pop();
		printf("Case #%d: %lld\n",ss,sum);
	}
}