Untitled

#include <bits/stdc++.h>
#define fio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define pb push_back
#define rep(s, n) for(int i=s;i<n;++i)
#define repr(i, n) for(int i=n;i>=0;--i)
#define all(x) x.begin(), x.end()
#define sz(x) int(x.size())
#define fi first
#define se second
#define endl '\n'
#define each(x, a) for (auto& x : a)
#define mem(a, b) memset(a, b, sizeof(a))
#define sortall(x) sort(all(x))
#define szof(arr) sizeof(arr)/sizeof(arr[0])
#define rrep(i, n) repr(i, n-1)
#define trav(a, x) for (auto& a : x)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c),x) != (c).end())
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MOD = 1e9 + 7;
const int INF = INT_MAX;
const ll LL_INF = LLONG_MAX;
int m,n,zm;
int color[101];
vi g[101];

void dfs(int s){
    color[s] = 1;
    for(int i : g[s]){
        if(!color[i])
        dfs(i);
    }
}

int main() {
    fio;
    cin>>n;
    rep(1,n+1){
        int s,o;
        cin>>s;
        while(s--){
            cin>>o;
            g[i].pb(o);
        }
    }

    rep(1,n+1){
        if(!color[i]){dfs(i);zm++;}
    }
    cout<<zm;
    return 0;
}