#include <vector>
#include <set>
#include <numeric>

using namespace std;

vector<bool> mark;

void dfs(const vector<vector<int> >& v, int k)
{
    mark[k] = false;

    for (int i = 0; i < v.size(); i++)
        if (v[k][i] != 0 && mark[i])
            dfs(v, i);
}

int main()
{
    int n;
    cin >> n;

    vector<vector<int> > v(n, vector<int>(n));

    for (int i = 0; i < n; i++)
    {
        int m;
        cin >> m;
        for (int j = 0; j < m; j++)
        {
            int t;
            cin >> t;
            v[i][t - 1] = 1;
        }
    }

    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
            swap(v[i][j], v[j][i]);

        mark.assign(n, true);

        dfs(v, i);

        for (int j = 0; j < n; j++)
        {
            if (mark[j])
                for (int k = 0; k < n; k++)
                    if (v[j][k] != 0 && !mark[k])
                        dfs(v, j);
        }

        if (accumulate(mark.begin(), mark.end(), 0) == 0)
        {
            cout << 1 << endl;
            return 0;
        }

        for (int j = 0; j < n; j++)
            swap(v[i][j], v[j][i]);
    }

    cout << 0 << endl;

    return 0;
}