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

using namespace std;

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

#define lim 100010
#define inf 2e9
int n;
vector <int> G[lim];
int path[lim], departat;

int bfs (int nod)
{
    queue <int> q;
    for (int i=1; i<=n; i++)    path[i] = inf;
    path[nod] = 1;
    q.push(nod);

    while (!q.empty())
    {
        int act = q.front();
        q.pop();
        for (auto it:G[act])
            if (path[it]==inf)
            {
                path[it] = path[act] + 1;
                q.push (it);
            }
    }
    path[0]=0;
    int maxim=0;
    for (int i=1; i<=n; i++)
        if (path[i]!=inf && path[i]>path[maxim])    maxim=i;
    return maxim;
}

int main()
{
    int x,y;
    fin>>n;
    for (int i=1; i<n; i++)
    {
        fin>>x>>y;
        G[x].push_back(y);
        G[y].push_back(x);
    }

    departat = bfs (x); /// cel mai departat nod de x
    fout << path [bfs (departat)];

    fin.close();
    fout.close();
    return 0;
}