#include<cstdio>
#include<vector>
#include<cstring>
#define NMAX 100005

using namespace std;

vector<int>v[NMAX];
int tata[NMAX],d[NMAX],viz[NMAX],viz1[NMAX],q[NMAX];
int n,m,i,poz,last,x,y,Max;

void BFS1(int nod)
{
    int i;
    viz[nod]=1;
    int st=1,dr=1;
    q[st]=nod;
    while(st<=dr)
    {
        int x=q[st];++st;
        last=x;
        for (i=0;i<v[x].size();++i)
        {
            if (viz[v[x][i]]==0)
            {
                q[++dr]=v[x][i];
                viz[v[x][i]]=1;
            }
        }
    }
}

void BFS2(int nod)
{
    int st=1,dr=1,i;
    q[st]=last;
    viz1[nod]=1;
    while(st<=dr)
    {
        int x=q[st];++st;
        if (d[x]>Max) Max=d[x],poz=x;
        for (i=0;i<v[x].size();++i)
        {
            int fiu=v[x][i];
            if (viz1[fiu]==0)
            {
                q[++dr]=fiu;
                d[fiu]=d[x]+1;
                tata[fiu]=x;
                viz1[fiu]=1;
            }
        }
    }
}

int main()
{
    freopen("darb.in","r",stdin);
    freopen("darb.out","w",stdout);
    scanf("%d",&n);
    for (i=1;i<=n-1;++i)
        {
            scanf("%d%d",&x,&y);
            v[x].push_back(y);
            v[y].push_back(x);
        }
    BFS1(1);
    d[last]=1;
    BFS2(last);
    printf("%d\n",Max);
    return 0;
}