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

const int MAXN = 300'001;

int col[MAXN];
vector<int> g[MAXN];

void solve() {
    int n; cin >> n;
    fill(col, col+MAXN, 0);
    for (int i = 1; i <= n; i++) {
        int x; cin >> x;
        while (x) {
            g[i].emplace_back(x);
            cin >> x;
        }
    }

    queue<int> st;
    for (int i = 1; i <= n; i++) st.push(i);

    while (!st.empty()) {
        int i = st.front(); st.pop();
        int cnt = 0;
        for (int j : g[i]) {
            if (col[i] == col[j]) cnt++;
        }
        if (cnt > 1) {
            col[i] ^= 1;
            for (int j : g[i]) {
                if (col[i] == col[j]) st.push(j);
            }
        }
    }

    for (int i = 1; i <= n; i++) {
        int cnt = 0;
        for (int j : g[i]) {
            if (col[i] == col[j]) cnt++;
        }
    }

    cout << count(col+1, col+n+1, 0) << "\n";
    for (int i = 1; i <= n; i++) {
        if (col[i] == 0) cout << i << " ";
    }
    cout << "\n";
}

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}