#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int second(vector<vector<int>>& a, int i, vector<int>& visited);

int first(vector<vector<int>>& a, int i, vector<int>& visited) {
    visited[i] = 1;
    if (a[i].size() == 0) {
        return 1;
    } else {
        int summ = 1;
        for (int j = 0; j < a[i].size(); ++j) {
            if (visited[a[i][j]] == 0) {
                summ += second(a, a[i][j], visited);
            }
        }
        return summ;
    }
}

int second(vector<vector<int>>& a, int i, vector<int>& visited) {
    visited[i] = 1;
    if (a[i].size() == 0) {
        return 0;
    } else {
        int summ = 0;
        for (int j = 0; j < a[i].size(); ++j) {
            if (visited[a[i][j]] == 0) {
                summ += first(a, a[i][j], visited);
            }
        }
        return summ;
    }
}

int main() {
    int v;
    cin >> v;
    vector<vector<int>> a(v);
    for (int i = 0; i < v; ++i) {
        vector<int> d;
        int k;
        cin >> k;
        for (int j = 0; j < k; ++j) {
            int b;
            cin >> b;
            d.push_back(b);
        }
        a[i] = d;
    }
    vector<int> visitedFirst(v, 0), visitedSecond(v, 0);
    int answer = 0;
    for (int i = 0; i < v; ++i) {
        if (visitedFirst[i] == 0) {
            answer += min(first(a, i, visitedFirst), second(a, i, visitedSecond));
        }
    }
    cout << answer;
    return 0;
}