#include <bits/stdc++.h>
using namespace std;

#define all(x) (x).begin(), (x).end()
using ll = long long;
const int p = 1e9+7;

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    int T; cin >> T; int ind = 0;
    while (T--)
    {
        cout << "Case #" << (++ind) << ": ";
        int n; cin >> n;
        vector<pair<ll,ll>> a(n); for (auto &x : a) cin >> x.first >> x.second;
        sort(all(a));
        ll ans = 1;
        for (int i = 0; i < n; ++i)
        {
            int j = i;
            ll sum = a[i].second;
            while(j + 1 < n && __lg(sum) >= (a[j+1].first - a[i].first)) 
            {
                ++j;
                sum += a[j].second << (a[j].first - a[i].first);
            } 
            i = j;
            ans = (ll)ans * ((sum + 1) % p) % p;
        }
        cout << ans << "\n";
    }
}