#include <iostream>
#include <vector>
#include <set>

using namespace std;

vector<set<int>> graph;
set<int> leaves;
vector<int> deg, take;

int main() {
    int n;
    cin >> n;
    deg.resize(n);
    graph.resize(n);
    for (int i = 0; i < n; ++i) {
        int c;
        cin >> c;
        if (c == 1) {
            leaves.insert(i);
        }
        deg[i] = c;
        for (int j = 0; j < c; ++j) {
            int x;
            cin >> x;
            graph[i].insert(x);
        }
    }
    take.assign(n, 2);
    while (!leaves.empty()) {
        int u = *leaves.begin();
        if (deg[u] == 1) {
            take[u] = 0;
            int v = *graph[u].begin();
            take[v] = 1;
            while (!graph[v].empty()) {
                int t = *graph[v].begin();
                graph[t].erase(v);
                --deg[t];
                if (deg[t] == 1) leaves.insert(t);
                graph[v].erase(graph[v].begin());
            }
            deg[v] = 0;
        }
        leaves.erase(u);
    }
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        if (take[i] == 1) {
            ++ans;
        }
    }
    cout << ans << "\n";
    return 0;
}