#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

#define ff              first
#define ss              second
#define int             long long
#define pb              push_back
#define mp              make_pair
#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int> >
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define mod             1000000007
#define inf             1e18
#define ps(x,y)         fixed<<setprecision(y)<<x
#define mk(arr,n,type)  type *arr=new type[n];
#define w(x)            int x; cin>>x; while(x--)
mt19937                 rng(chrono::steady_clock::now().time_since_epoch().count());
#define fastio          ios_base::sync_with_stdio(0); cin.tie(0);

bool cmp1(pair<pair<string,int>,int>&a,pair<pair<string,int>,int>&b)
{
    if(a.ff.ff==b.ff.ff) return a.ss<b.ss;
    return a.ff.ff<b.ff.ff;
}
bool cmp2(pair<pair<string,int>,int>&a,pair<pair<string,int>,int>&b)
{
    if(a.ff.ss==b.ff.ss) return a.ss<b.ss;
    return a.ff.ss<b.ff.ss;
}

int32_t main()
{
    int tt;cin>>tt;
    for(int t=1;t<=tt;t++)
    {
        int n;
        cin>>n;
        vector<pair<pair<string,int>,int>> a(n),b(n);
        for(int i=0;i<n;i++)
        {
            int d,u;string s;
            cin>>s>>d>>u;
            a[i]={{s,d},u};
            b[i]={{s,d},u};
        }
        sort(a.begin(),a.end(),cmp1);
        sort(b.begin(),b.end(),cmp2);
        int ans=0;
        for(int i=0;i<n;i++) if(a[i]==b[i]) ans++;
        cout<<"Case #"<<t<<": "<<ans<<"\n";

    }
return 0;
}