#include <bits/stdc++.h>

struct Node {
    int e[26];
    int val;
    int dep;
    int par;
    Node(int dep = 0, int par = -1) : e{}, val(0), dep(dep), par(par) {}
};

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;
    for (int nCase = 1; nCase <= t; ++nCase) {
        int n;
        std::cin >> n;
        
        std::vector<Node> t(1);
        
        std::vector<std::string> s(n);
        std::vector<int> val(n), pos(n);
        for (int i = 0; i < n; ++i) {
            std::cin >> s[i] >> val[i];
            
            int p = 0;
            for (auto c : s[i]) {
                if (t[p].e[c - 'a'] == 0) {
                    t[p].e[c - 'a'] = t.size();
                    t.emplace_back(t[p].dep + 1, p);
                }
                p = t[p].e[c - 'a'];
            }
            
            pos[i] = p;
        }
        
        std::vector<int> p(n);
        std::iota(p.begin(), p.end(), 0);
        std::sort(p.begin(), p.end(), [&](int i, int j) { return val[i] < val[j]; });
        
        for (int i = 0; i < n; ) {
            int j = i;
            while (j < n && val[p[i]] == val[p[j]]) ++j;
            
            int u = pos[p[i]];
            for (int k = i + 1; k < j; ++k) {
                int v = pos[p[k]];
                while (u != v) {
                    if (t[u].dep > t[v].dep) u = t[u].par;
                    else v = t[v].par;
                }
            }
            t[u].val = val[p[i]];
            
            i = j;
        }
        
        std::vector<int> f(t.size());
        
        std::function<int(int)> dfs = [&](int u) {
            int siz = t[u].val > 0;
            int lst = t[u].val;
            for (int i = 0; i < 26; ++i) {
                int v = t[u].e[i];
                if (v > 0) {
                    int x = dfs(v);
                    if (x == 0) siz += 2;
                    else if (x > 0) siz += 1;
                    if (siz >= 2 && lst > 0) f[u] = lst, lst = 0;
                    if (x > 0) {
                        if (siz == 1) lst = x;
                        else if (f[u] == 0) f[u] = x;
                        else f[v] = x;
                    }
                }
            }
            if (siz == 0) return -1;
            else if (siz == 1) return lst;
            else return 0;
        };
        int x = dfs(0);
        if (x > 0) f[0] = x;
        
        for (int i = t.size() - 1; i > 0; --i)
            if (f[i] != 0 && f[t[i].par] == 0) f[t[i].par] = -1;
        
        bool ok = true;
        for (int i = 0; i < n; ++i) {
            int u = pos[i];
            while (f[u] == 0) u = t[u].par;
            if (f[u] != val[i]) ok = false;
        }
        
        int ans = ok ? std::count_if(f.begin(), f.end(), [&](int x) { return x != 0; }) : -1;
        
        std::cout << "Case #" << nCase << ": " << ans << "\n";
    }
    
    return 0;
}