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

using namespace std;

//queue <int> Q;
vector <int> a[100005];
int d[100005], n, L, Di;
bool v[100005];

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

void DFS(int k, int x)
{
    v[k] = true;
    int l = a[k].size();
    for (int i = 0; i < l; i++)
        if (!v[a[k][i]])
        {
            d[a[k][i]] = x + 1;
            L = a[k][i];
            Di = max(d[a[k][i]], Di);
            DFS(a[k][i], x + 1);
        }
    v[k] = false;
}

int main()
{
    int i, x, y;
    fin >> n;
    for (i = 1; i < n; i++)
    {
        fin >> x >> y;
        a[x].push_back(y);
        a[y].push_back(x);
    }
    d[1] = 0;
    DFS(1, 0);
    DFS(L, 0);
    //cout << Di;
    fout << Di << "\n";
    return 0;
}