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

typedef long long int ll;
#define IOS ios_base::sync_with_stdio(0);  cin.tie(0); cout.tie(0);

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>order_set;
typedef pair<int, int>pr;
#define all(i)     i.begin() , i.end()
#define ft     first
#define sn     second
#define pb     push_back
#define totalone(mask)  __builtin_popcount(mask)
#define chkbit(mask,bit)  (mask&(1LL << bit))

// debug section start
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i : x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// debug section closed

#define en "\n"
#define sum(n) ((1LL*(n)*(n+1))/ 2LL)
#define sqr(n) (1LL*(n)*(n))
#define vag(a,b) ((a + b - 1)/b)

#define MAXN 200005
#define inf 1e6+5
const int mod = 1e9 + 7;

struct trie
{
    int g[101 * 51 * 27][27];
    int cur;

    void init()
    {
        memset(g, -1, sizeof(g));
        cur = 0;
    }
    int Insert(string s)
    {
        int nd = 0;
        int cn = 0;
        for (int i = 0; i < s.size(); i++)
        {
            int x = s[i] - 'a';
            if (g[nd][x] == -1) {
                cn++;
                g[nd][x] = ++cur;
            }
            nd = g[nd][x];
        }
        return cn;
    }

} tri;
void solve()
{
    int n;
    cin >> n;
    string s;

    tri.init();
    int an = n;
    string pre = "";

    for (int i = 0; i < n; i++) {
        cin >> s;

        int tm = tri.Insert(s);
        if (i == 0) {
            an += tm;
            pre = s;
            continue;
        }

        if (s.size() < pre.size())
        {
            an += (tm + 2);
        }
        else {
            int sz = pre.size();
            string ss = s.substr(0, sz);
            if (ss == pre)
            {
                an += min(tm + 2, (int)s.size() - sz);
            }
            else {
                an += (tm + 2);
            }

        }
        pre = s;

    }

    cout << an << en;
}

int main()
{
    IOS;
    ll t;
    t = 1;
    cin >> t;

    int c = 0;
    while ( t-- )
    {
        // cout<<"Case "<<++c<<": ";
        cout << "Case #" << ++c << ": ";
        solve();
    }
    return 0;
}