UVa 11729

#include <cstdio>
#include <algorithm>
#include <iostream>


using namespace std;


int sumx,ans;
int n;
int num;
struct Point{
int x,y;
}a[10010];


bool cmp(Point x,Point y)
{
return x.y>y.y;
}




int main()
{
while(scanf("%d",&n))
{
if(n==0) return 0;
for(int i=0;i<n;i++) scanf("%d%d",&a[i].x,&a[i].y);
sort(a,a+n,cmp);
ans=0;
sumx=0;
for(int i=0;i<n;i++)
{
sumx+=a[i].x;
ans=max(ans,sumx+a[i].y);
}
printf("Case %d: %d\n",++num,ans);
}
return 0;
}