#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream f("darb.in");
ofstream g("darb.out");

const int NMAX = 100001;
int N, ult, dist[NMAX];
bool viz[NMAX];
vector<int> lista[NMAX];
queue<int> coada;

 void BFS(int x)
{
    viz[x] = true;
    coada.push(x);
    while(!coada.empty())
    {
        int crt = coada.front();
        for(auto &it : lista[crt])
            if(viz[it] == false)
            {
                coada.push(it);
                dist[it] = dist[crt] + 1;
                viz[it] = true;
                ult = it;
            }
        coada.pop();
    }
}
int main()
{
    int x, y;
    f >> N;
    for(int i = 1; i < N; i++)
    {
        f >> x >> y;
        lista[x].push_back(y);
        lista[y].push_back(x);
    }
    BFS(1);
    for(int i = 1; i <= N; i++)
        viz[i] = false, dist[i] = 1;
    BFS(ult);
    g << dist[ult];
    return 0;
}