#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 100000 + 5;
const int INF32 = 0x3f3f3f3f;

int N, ch[MAX_N][26], tot, val[MAX_N];
vector <int> node[MAX_N];
int fa[MAX_N], dep[MAX_N], sz[MAX_N], bs[MAX_N], tp[MAX_N], cnt[MAX_N];

int ins(const string &s) {
    int u = 0;
    for (auto c : s) {
        int &v = ch[u][c - 'a'];
        v = v ? v : ++ tot;
        u = v;
    }
    return u;
}

void dfs1(int u, int fath) {
    sz[u] = 1;
    bs[u] = -1;
    fa[u] = fath;
    dep[u] = dep[fath] + 1;
    cnt[u] = val[u] != 0;
    for (int i = 0; i < 26; i ++) {
        int v = ch[u][i];
        if (v) {
            dfs1(v, u);
            sz[u] += sz[v];
            if (bs[u] < 0 || sz[bs[u]] < sz[v]) bs[u] = v;
            if (cnt[v] > 1) {
                cnt[u] = 2;
            }else if (cnt[v]) {
                if (!cnt[u] || val[u] != val[v]) {
                    cnt[u] ++;
                    val[u] = val[v];
                }
            }
        }
    }
}

void dfs2(int u, int gr) {
    tp[u] = gr;
    if (bs[u] != -1) dfs2(bs[u], gr);
    for (int i = 0; i < 26; i ++) {
        int v = ch[u][i];
        if (v && v != bs[u]) {
            dfs2(v, v);
        }
    }
}

int Lca(int u, int v) {
    if (!u || !v) return u | v;
    while (tp[u] != tp[v]) {
        if (dep[tp[u]] < dep[tp[v]]) v = fa[tp[v]];
        else u = fa[tp[u]];
    }
    return dep[u] < dep[v] ? u : v;
}

void solve(int cas) {
    for (int i = 1; i <= N; i ++) {
        node[i].clear();
    }
    memset(val, 0, sizeof(int) * (tot + 1));
    while (tot) memset(ch[-- tot], 0, sizeof(int) * 26);
    cin >> N;
    int M = 0;
    char flag = 0;
    map <int, int> idx;
    for (int i = 1; i <= N; i ++) {
        string str; int v;
        cin >> str >> v;
        int u = ins(str);
        if (val[u] && val[u] != v) flag = 1;
        val[u] = v;
        if (idx.find(v) == idx.end()) idx[v] = ++ M;
        node[idx[v]].emplace_back(u);
    }
    cout << "Case #" << cas << ": ";
    if (flag) {
        cout << "-1\n";
        return ;
    }
    dfs1(0, -1); dfs2(0, 0);
    memset(val, 0, sizeof(int) * (tot + 1));
    int ans = tot + 1;
    for (int i = 1; i <= M; i ++) {
        int lca = 0;
        for (auto u : node[i]) {
            lca = Lca(u, lca);
        }
        if (cnt[lca] > 1) {
            if ((int)node[i].size() == 1) {
                val[lca] = 1;
                continue;
            }
            cout << "-1\n";
            return ;
        }
    }
    for (int i = 1; i <= M; i ++) {
        int lca = 0;
        for (auto u : node[i]) {
            lca = Lca(u, lca);
        }
        if (cnt[lca] == 1) {
            while (lca && cnt[fa[lca]] == 1) lca = fa[lca];
            if (lca && !val[fa[lca]]) {
                ans --;
                val[fa[lca]] = 1;
            }
            ans -= sz[lca] - 1;
        }
    }
    cout << ans << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    
    int T;
    cin >> T;
    for (int i = 1; i <= T; i ++) solve(i);
    
    return 0;
}