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

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds; 
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define MOD 1000000007
using ll = long long;
using dbl = long double;
//#define int ll

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<vii> vvii;
#define ff first
#define ss second
#define pb push_back
#define endl '\n'
#define all(s) s.begin(), s.end()
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define sz(x) (int)(x).size()
#define tc int t; cin>>t; while(t--)
#define fightFight cin.tie(0) -> sync_with_stdio(0)

// Have not tested MIS, but vertex-cover was tested so :)
struct DinicMatching {
    struct Edge {
        int to, rev;
        ll c, oc;
        int id;
        ll flow() { return max(oc - c, 0LL); } // if you need flows
        ll rflow() { return max(c - oc, 0LL); } // if you need reverse flows
    };

    int n, m;
    ll memoized_maxflow;
    bool match_called = false, maxflow_called = false, reachable_called = false;
    vi lvl, ptr, q, reachable, lmatch, rmatch;
    vector<vector<Edge>> adj;
    // Util functions, use from solve(). Passing true to xdex reverses transform
    int ldex(int v, bool rev = false) { return (!rev) ? v + 1 : v - 1; }
    int rdex(int v, bool rev = false) { return (!rev) ? n + v + 1 : v - n - 1; }
    bool isLeft(int v) { return (v >= 1 and v <= n); }
    bool isRight(int v) { return (v > n and v <= n+m); }

    void __addEdge(int a, int b, ll c, int id = 0, ll rcap = 0) {
        adj[a].push_back({b, sz(adj[b]), c, c, id});
        adj[b].push_back({a, sz(adj[a]) - 1, rcap, rcap, id});
    }
    // ENSURE that id is non-zero, necessary for reachable_dfs to work
    void addEdge(int l, int r, int id = 1){
        __addEdge(ldex(l), rdex(r), 1, id);
    }
    ll dfs(int v, int t, ll f) {
        if (v == t || !f) return f;
        for (int& i = ptr[v]; i < sz(adj[v]); i++) {
            Edge& e = adj[v][i];
            if (lvl[e.to] == lvl[v] + 1)
                if (ll p = dfs(e.to, t, min(f, e.c))) {
                    e.c -= p, adj[e.to][e.rev].c += p;
                    return p;
                }
        }
        return 0;
    }
    ll max_matching() {
        if(maxflow_called) return memoized_maxflow;
        maxflow_called = true;
        int s = 0, t = n + m + 1;
        ll flow = 0; q[0] = s;
        rep(L,0,31) do { // 'int L=30' maybe faster for random data
            lvl = ptr = vi(sz(q));
            int qi = 0, qe = lvl[s] = 1;
            while (qi < qe && !lvl[t]) {
                int v = q[qi++];
                for (Edge e : adj[v])
                    if (!lvl[e.to] && e.c >> (30 - L))
                        q[qe++] = e.to, lvl[e.to] = lvl[v] + 1;
            }
            while (ll p = dfs(s, t, LLONG_MAX)) flow += p;
        } while (lvl[t]);
        return memoized_maxflow = flow;
    }
    // Computes lmatch & rmatch. Access from solve().
    // Note: Can be made to store edge id also, just use vii instead.
    //       But if TL is generous, can get along with map<pii, int>.
    // COMMON MISTAKE: Storing {u, v} = {v, u} in map when u, v are 0 indexed for the set
    void match() {
        if(match_called) return;
        match_called = true;
        lmatch.assign(n, -1), rmatch.assign(m, -1);
        for(int u=0; u < n; u++){
            for(auto &e : adj[ldex(u)]){
                if(!e.id or e.flow() == 0) continue;
                int v = rdex(e.to, true);
                lmatch[u] = v;
                rmatch[v] = u;
            }
        }
    }
    void reachable_dfs(int v){
        if(reachable[v]) return;
        reachable[v] = true;
        for(auto &e : adj[v]){
            if(!e.id) continue;
            if(isLeft(v) and e.flow() == 0) reachable_dfs(e.to);
            if(isRight(v) and e.rflow() == 1) reachable_dfs(e.to);
        }
    }
    void solve_reachable(){
        if(reachable_called) return;
        reachable_called = true;
        max_matching(); match();
        reachable.assign(n + m + 2, 0);
        for(int v=0; v < n; v++)
            if(lmatch[v] == -1) reachable_dfs(ldex(v));
    }
    vi vertex_cover(){
        solve_reachable();
        vi vcover; vcover.reserve(memoized_maxflow);
        for(int v=0; v < n; v++)
            if(!reachable[ldex(v)]) vcover.pb(ldex(v));
        for(int v=0; v < m; v++)
            if(reachable[rdex(v)]) vcover.pb(rdex(v));
        return vcover;
    }
    vi maximum_independent_set(){
        solve_reachable();
        vi MIS; MIS.reserve(n + m - memoized_maxflow);
        for(int v=0; v < n; v++)
            if(reachable[ldex(v)]) MIS.pb(ldex(v));
        for(int v=0; v < m; v++)
            if(!reachable[rdex(v)]) MIS.pb(rdex(v));
        return MIS;
    }
    bool leftOfMinCut(int a) { return lvl[a] != 0; }

    DinicMatching(int N) : lvl(N), ptr(N), q(N), adj(N) {}
    DinicMatching(int _n, int _m) : DinicMatching(_n + _m + 2) {
        n = _n, m = _m;
        int source = 0, sink = n + m + 1;
        for(int v=0; v < n; v++) __addEdge(source, ldex(v), 1);
        for(int v=0; v < m; v++) __addEdge(rdex(v), sink, 1);
    }
};
void solve(){

    int n; cin >> n;
    int idx = 1;
    map<string, int> id;
    vector<vi> teachers;
    int max_nodes = 0;
    for(int i=0; i < n; i++){
        int a; cin >> a;
        vi t;
        for(int j=0; j < a; j++){
            string x; cin >> x;
            if(!id.count(x)) id[x] = idx++;
            t.pb(id[x]);
        }
        max_nodes += (1 << a);
        sort(all(t));
        teachers.pb(t);
    }

    auto get_submask = [&](vi &x, int mask){
        vi ret;
        for(int i=0; i < sz(x); i++)
            if(mask & (1 << i)) ret.pb(x[i]);
        return ret;
    };

    idx = 0;
    map<vi, int> subid;
    auto get_id = [&](vi &&x){
        if(subid.count(x)) return subid[x];
        else return subid[x] = idx++;
    };

    DinicMatching net(max_nodes, max_nodes);
    for(auto &t : teachers){
        for(int mask = 1; mask < (1 << sz(t)); mask++){
            int big_id = get_id(get_submask(t, mask));
            for(int i = mask; i > 0; i = (i-1) & mask){
                if(i == mask) continue;
                int small_id = get_id(get_submask(t, i));
                net.addEdge(big_id, small_id);
            }
        }
    }

    cout << idx - net.max_matching() << endl;

}

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
    fightFight;
    solve();   
}