#include<fstream>
#include<iostream>
#include<queue>
#include<vector>
using namespace std;
ifstream in ("darb.in");
ofstream out("darb.out");
vector <int> v[100000],d;
queue <int> q;
int n;
    int maxim=-1;
void declarare_d()
{
    int i;
    for(i=0;i<=n;i++)
        d.push_back(0);
}
void citire()
{
    int x,y,i;
    in>>n;
    for(i=1;i<=n-1;i++)
    {
        in>>x>>y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
}
void lat(int nod)
{
    int i;
    for(i=1;i<=n;i++)
    {
        if(i!=nod)
            d[i]=-1;
        else
            d[i]=1;

    }
    q.push(nod);
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        for(i=0;i<v[x].size();i++)
        {
            int vecin=v[x][i];
            if(d[vecin]==-1)
            {
                d[vecin]=d[x]+1;
                q.push(vecin);
            }
        }
    }
    for(i=1;i<=n;i++)
        if(d[i]>maxim)
            maxim=d[i];
}
int main()
{
    citire();
    declarare_d();
    int i,j;
    for(i=1;i<=n;i++)
        lat(i);
    out<<maxim;
    return 0;
}