hdu4221

#include<iostream>
#include<cstdio>
#include<list>
#include<algorithm>
#include<cstring>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#include<cmath>
#include<memory.h>
#include<set>

#define ll long long
#define LL __int64
const ll INF=9999999999999;

using namespace std;

#define M 50010
#define inf 0xfffffff

//vector<int,int> G[20002];
//vector<pair<int,int>> ::iterator iter;

//map<ll,int>mp;
//map<ll,int>::iterator p;

int n;

struct Node 
{
	LL s,e;
}node[100002];

bool cmp(Node x,Node y) 
{
	return x.e < y.e;
}

int main(void)
{
	int t,Case=0;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		for(int i=0;i<n;i++) 
			scanf("%d %d",&node[i].s,&node[i].e);
		sort(node,node+n,cmp);
		LL ans=0;
		LL sum=0;
		for(int i=0;i<n;i++)
		{
			sum+=node[i].s;
			ans=max(ans,sum-node[i].e);
		}
		printf("Case %d: %I64d\n",++Case,ans);
	}
}