// UUID: 4e1a72ed-ca83-47c3-92fe-3e06fd261e67
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 300'001;

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

void dfs(int u, int d = 0) {
    col[u] = d;
    for (int v : g[u]) {
        if (col[v] == -1) dfs(v, d^1);
    }
}

void solve() {
    int n; cin >> n;
    fill(col, col+MAXN, -1);
    for (int i = 1; i <= n; i++) {
        int x; cin >> x;
        while (x) {
            g[i].emplace_back(x);
            g[x].emplace_back(i);
            cin >> x;
        }
    }
    for (int i = 1; i <= n; i++) {
        if (col[i] == -1) {
            dfs(i);
        }
    }
    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;
}