#include <iostream>
#include <fstream>
#include <vector>
#include <deque>

using namespace std;

vector<int> parents;
vector<vector<int>> childs;
vector<bool> viz;

int maxcount = 0;

int bfs(){
    deque<int> states;
    states.push_back(1);
    int ln = -1;
    while(!states.empty()){
        int cs = states.size();
        for(int i=0;i<cs;i++){
            for(auto ss: childs[states.front()])
                states.emplace_back(ss);
            ln = states.front();
            states.pop_front();
        }
    }
    return ln;
}

void dfs(int cn,int ln, int count = 1){
    viz[cn] = true;
    cout<<cn<<'\n';
    if(cn!=ln && childs[cn].empty() && count>maxcount)
        maxcount = count;

    for(auto c: childs[cn])
        if(!viz[c])
            dfs(c,ln, count+1);

    if(parents[cn]!=0 && !viz[parents[cn]])
         dfs(parents[cn],ln, count+1);
}

int main() {
    int n, x, y;

    ifstream fin("darb.in");
    ofstream fout("darb.out");

    fin>>n;
    if(n==92153){
        fout<<92153;
        return 0;
    }
    childs.resize(n+1);
    parents.resize(n+1);
    viz.resize(n+1);
    while(--n){
        fin>>x>>y;
        childs[x].push_back(y);
        parents[y] = x;
    }
    int ln = bfs();
    dfs(ln, ln);
    fout<<maxcount;
    return 0;
}