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

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n; cin >> n;
    vector<vector<int>> adj(n);
    vector<int> state(n, -1);
    vector<int> hate(n, 0);
    for (int i = 0; i < n; i++) {
        state[i] = i%2;
        int e;
        while (cin >> e) {
            if (e == 0) break;
            e--;
            adj[i].push_back(e);
        }
    }

    queue<int> bad;
    vector<int> in_queue(n, false);
    for (int i = 0; i < n; i++) {
        for (const int& e : adj[i]) {
            if (state[i] == state[e]) {
                hate[i]++;
            }
        }
        if (hate[i] >= 2 && !in_queue[i]) {
            bad.push(i);
            in_queue[i] = true;
        }
    }
    
    while (!bad.empty()) {
        int e = bad.front();
        bad.pop();
        in_queue[e] = false;
        for (const int& m : adj[e]) {
            if (state[e] == state[m]) {
                hate[m]--;
            }
        }
        state[e] = (state[e] == 0) ? 1 : 0; // fordít
        for (const int& m : adj[e]) {
            if (state[e] == state[m]) {
                hate[m]++;
            }
        }
        
        hate[e] = 0;
        for (int& m : adj[e]) {
            if (state[e] == state[m]) {
                hate[e]++;
            }
            if (hate[m] >= 2 && !in_queue[m]) {
                bad.push(m);
                in_queue[m] = true;
            }
        }

        if (hate[e] >= 2 && !in_queue[e]) {
            bad.push(e);
            in_queue[e] = true;
        }
    }

    vector<int> res;
    for (int i = 0; i < n; i++) {
        if (state[i] == 0) res.push_back(i+1);
    }

    cout << res.size() << "\n";
    for (int i : res) cout << i << " ";
	
    return 0;
}