#include <bits/stdc++.h>

using namespace std;

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

vector<int> noduri[100001];
int n, dmax=0;
bool vizitat[100001];

void dfs(int nod, int dist){
    if (dist > dmax){
        dmax = dist;

    }
    vizitat[nod] = true;

    for (auto vecin: noduri[nod]){
        if (!vizitat[vecin])
            dfs(vecin, dist+1);
    }

    vizitat[nod] = false;
}

int main()
{
    fin>>n;
    for (int i=0; i<n-1; i++){
        int x,y;
        fin>>x>>y;
        noduri[x].push_back(y);
        noduri[y].push_back(x);
    }
    for (int i=1; i<=n; i++)
        dfs(i,0);
    fout<<dmax+1;

	return 0;
}