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

vector<int> adj[30];
bool visited[30];

void dfs(int u) {
    int v;
    visited[u] = true;
    for(int k = 0; k < adj[u].size(); ++k) {
        v = adj[u][k];
        if (!visited[v]) {
            dfs(v);
        }
    }
}

int cases;
string v;

int main () {
    cin >> cases;
    getline(cin, v);
    getline(cin, v);
    while(cases--) {
        getline(cin, v);
        int times = v[0] - 64;
        memset(visited, false, sizeof(visited));
        getline(cin, v);
        cout << v << "esse e V" << endl;
        while(v != "") {
            int v1 = v[0] - 65;
            int v2 = v[1] - 65;
            adj[v1].push_back(v2);
            adj[v2].push_back(v1);
            getline(cin, v);
            cout << v;
        }
        bool check = false;
        int cont = 0;
        cout << "CONTADOR";
        while(!check) {
            check = true;
            if (visited[cont]) {
                check = false;
                continue;
            }
            dfs(cont);
            for (int i = 0; i < times && check; ++i) {
                if(!visited[i]) {
                    check = false;
                }
            }
            cont++;
        }
        for (int i = 0; i < times; ++i) {
            adj[i].clear();
        }
        cout << cont << endl;
    }
    return 0;
}