#include <iostream>
#include <fstream>
#include <vector>
#include <list>
#include <queue>
using namespace std;
ifstream fin("darb.in");
ofstream fout("darb.out");
int n,m;
vector <list <int> >L;
void Citire()
{
    int x,y;
    fin>>n;
    L.resize(n+1);
    for(int i=1;i<=n-1;i++)
    {
        fin>>x>>y;
        L[x].push_back(y);
        L[y].push_back(x);
    }
}
vector <int> viz,dist;
int diametru, last;
queue <int> Q;
void BFS(int start)
{
    for(int i=1;i<=n;i++) dist[i]=0;
    for(int i=1;i<=n;i++) viz[i]=0;
    Q.push(start);
    dist[start]=1;
    viz[start]=1;
    while(!Q.empty())
        {
        int v=Q.front();
        for(list <int> ::iterator it=L[v].begin(); it!=L[v].end(); it++)
        {
            if(viz[*it]==0)
            {
                Q.push(*it);
                dist[*it]=dist[v]+1;
                viz[*it]=1;

                diametru=dist[*it];
                last=*it;
            }
        }
        Q.pop();
    }
}
int main()
{
    Citire();
    dist.resize(n+1);
    viz.resize(n+1);
    BFS(1);
    BFS(last);

    fout<<diametru;
    return 0;
}