// Author : hejinming2012
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define dbg(x) cout << #x " = " << (x) << endl
#define quickio ios::sync_with_stdio(false);
#define quickin cin.tie(0);
#define quickout cout.tie(0);

using namespace std;
inline int read() {
	int now = 0, nev = 1; char c = getchar();
	while(c < '0' || c > '9') { if(c == '-') nev = -1; c = getchar(); }
	while(c >= '0' && c <= '9') { now = (now << 1) + (now << 3) + (c & 15); c = getchar(); }
	return now * nev;
}
void write(int x) {
	if(x < 0) putchar('-'), x = -x;
	if(x > 9) write(x / 10);
	putchar(x % 10 + '0');
}
struct node {
	int a, k;
};
void per(int K[]) {
	for(int i = 1; i <= 100000; i++) {
		double tmp = sqrt(1 + 8 * i);
		int s = floor(tmp);
		if(s * s < 1 + 8 * i) s++;
		int num = s / 2;
		K[i] = num;
	}
}
int K[100005];
signed main() {
	quickio
	quickin
    quickout
    per(K); int T = read();
	for(int _ = 1; _ <= T; _++) {
		int n = read();
		vector <node> mons(n);
		for(int i = 0; i < n; i++) {
			int HP = read(), AT = read();
			mons[i].a = AT, mons[i].k = K[HP];
		}
		sort(mons.begin(), mons.end(), [&](const node &x, const node &y) -> bool {
			return (x.a * y.k) > (y.a * x.k);
		});
		int tot = 0, cur = 0;
		for(auto &i : mons) {
			cur += i.k;
			tot += i.a * cur;
		}
		printf("Case #%lld: %lld\n", _, tot);
	}
	return 0;
}