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

using namespace std;

#define MAX 100005

vector < int > v[MAX];
queue < int > coada;
int n, viz[MAX], x, y, rez, last, first, diametru[MAX], level[MAX], lvlmax, ultim;

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

void dfs(int nod)
{
    viz[nod] = 1;
    for(int i = 0; i < v[nod].size(); i++)
    {
        int vecin = v[nod][i];
        if(viz[vecin] == 0){
            level[vecin] = level[nod] + 1;
            if(level[vecin] > lvlmax)
            {
                lvlmax = level[vecin];
                ultim = vecin;
            }
            dfs(v[nod][i]);
        }
    }
}

void diam(int x)
{
    coada.push(x);
    viz[x] = 1;
    while(!coada.empty())
    {
        int nod = coada.front();
        coada.pop();
        for(int i = 0; i < v[nod].size(); i++)
        {
            if(viz[v[nod][i]] == 0)
            {
                coada.push(v[nod][i]);
                viz[v[nod][i]] = 1;
                diametru[v[nod][i]] = diametru[nod] + 1;
            }
        }
    }
}

int main()
{
    fin >> n;
    for(int i = 1; i < n; i++)
    {
        fin >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    level[1] = 1;
    dfs(1);
    last = ultim;
    for(int i = 1; i <= n; i++)
        viz[i] = 0;
    diam(last);
    for(int i = 1; i <= n; i++)
        rez = max(rez, diametru[i]);
    fout << rez + 1 << "\n";
    return 0;
}