#include <iostream>

#include <algorithm>

#include <cstdio>

#define RPE(i,n) for(int i=0;i<n;i++)

using namespace std;

const int maxn=1e4+;

struct node

{

    public:

    int x,y;

    bool operator < (const node &another) const

    {

        return y>another.y;

    }

}b[maxn];

int main()

{

    ios::sync_with_stdio(false);

    int n,ca=;

    while(cin>>n&&n)

    {

        RPE(i,n) cin>>b[i].x>>b[i].y;

        sort(b,b+n);

        int time=;

        int Max=-;

        RPE(i,n)

        {

            time+=b[i].x;

            Max=max(time+b[i].y,Max);

        }

        cout<<"Case "<<ca++<<": "<<Max<<endl;

    }

    return ;

}