#include<iostream>

#include<algorithm>

#include<vector>

using namespace std;

struct node{

    int x, y;

    bool operator < (const node &b) const{

        return y>a.y;

    }

};

int n, t, x, y;

int main(){

        while(cin>>n, n){

            vector<node>v;

            for(int i=;i<n;++i){

                cin>>x>>y;      v.push_back((ndoe){x, y});

            }

            sort(v.begin(), v.end());

            int res=, ans=;

            for(int i=;i<n;++i){

                res+=v[i].x;

                ans=max(ans, res+v[i].y);

            }

            cout<<"Case "<<++t<<": "<<ans<<endl;

        }

}