#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <cassert>
#ifndef LOCAL
#include <bits/stdc++.h>
#endif

#define pb push_back
#define mp make_pair

#define f first
#define s second

using namespace std;

const int N = (int) 1e6 + 7;
const int MOD = (int) 1e9 + 9;

int n;
int a[N];
int b[N];

void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        int d, l, r;
        cin >> d >> l >> r;
        a[i] = d + l;
        b[i] = d - r;
    }
    int ans = 0, cnt = 0;
    for (int i = 1; i <= n; i++) {
        int A = a[i];
        int B = MOD;
        int len = 0;
        for (int j = i; j <= n; j++) {
            if (a[j] == A) {
                len++;
                continue;
            }
            if (B == MOD)
                B = b[j];

            if (b[j] == B) {
                len++;
                continue;
            }
            break;
        }
        int _A = MOD;
        int _B = b[i];
        int _len = 0;
        for (int j = i; j <= n; j++) {
            if (b[j] == _B) {
                _len++;
                continue;
            }
            if (_A == MOD)
                _A = a[j];

            if (a[j] == _A) {
                _len++;
                continue;
            }
            break;
        }
        len = max(len, _len);
        if (len > ans) ans = len, cnt = 1;
        else if (len == ans) ++cnt;
    }
    cout << ans << ' ' << cnt << "\n";
}

int main() {
    #ifdef LOCAL
    freopen("in.txt", "r", stdin);
    #endif

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int cases;
    cin >> cases;
    for (int t = 1; t <= cases; t++) {
        cout << "Case #" << t << ": ";
        solve();
    }

    return 0;
}