#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const double pi = acos(-1.0);
const double EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

//無向グラフでのdfs
//計算量 パス検出:O(N+M)、閉路検出:O(N+M)

struct Graph{
    vector<vector<int>> es;
    vector<int> used;
    vector<int> keep;
    const int n;

    Graph(int n) : n(n){
        es.resize(n), used.resize(n);
    }

    void add_edge(int from, int to, bool directed = false){
        es[from].eb(to);
        if(!directed) es[to].eb(from);
    }

    bool trace(int now, int t){
        used[now] = true;
        if(now == t) {keep.eb(now); return true;}
        for(auto &e: es[now]){
            if(used[e]) continue;
            if(trace(e, t)) {keep.eb(now); return true;}
        }
        return false;
    }

    vector<int> find_path(int s, int t){
        keep.clear(), fill(all(used), 0);
        trace(s, t), reverse(all(keep));
        return keep;
    }

    int detect(int now, int pre){
        if(used[now]++) return 1;
        for(auto &e: es[now]){
            if(e == pre) continue;
            int k = detect(e, now);
            if(k == 2) return 2;
            if(k == 1) {keep.eb(now); return used[now];}
        }
        return 0;
    }

    vector<int> find_loop(){
        keep.clear(), fill(all(used), 0);
        rep(i, n){
            if(used[i]) continue;
            detect(i, -1);
            if(!keep.empty()) {reverse(all(keep)); return keep;}
        }
        return keep;
    }
};

//https://yukicoder.me/problems/no/1254

int main(){
    int N;
    cin >> N;
    Graph G(N);
    map<pii, int> mp;
    rep(i, N){
        int u, v; cin >> u >> v; u--, v--;
        G.add_edge(u, v);
        mp[minmax(u, v)] = i;
    }
    vector<int> loop = G.find_loop();
    int n = sz(loop);
    cout << n << endl;
    rep(i, n){
        int j = (i+1)%n;
        cout << mp[minmax(loop[i], loop[j])]+1 << ' ';
    }
    cout << endl;
}