#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define MP(a, b) make_pair(a, b)
const int MAXN = 1000 + 10;
const int INF = 0x3f3f3f3f;
 
struct P
{
    int b, j;
    bool operator < (const P &a) const
    {
        return j > a.j;
    }
}pp[MAXN];
 
int main()
{
    //freopen("input.txt", "r", stdin);
    int n, i, j, cases = 0;
    while (scanf("%d", &n), n)
    {
        for (i = 0; i < n; i++)
            scanf("%d%d", &pp[i].b, &pp[i].j);
        sort(pp, pp + n);
        int ans = 0, vt = 0;
        for (i = 0; i < n; i++)
        {
            vt += pp[i].b;
            ans = max(ans, vt + pp[i].j);
        }
        printf("Case %d: %d\n", ++cases, ans);
    }
    return 0;
}