#include <bits/stdc++.h>
using namespace std;
ifstream f("darb.in");
ofstream g("darb.out");
vector <int> v[100001];
int n, x, y, maxx, frunza;
bool viz[100001];
void dfs(int k, int lg)
{
    if(lg > maxx)
    {
        maxx = lg;
        frunza = k;
    }
    viz[k] = 1;
    for(vector <int> :: iterator it = v[k].begin(); it != v[k].end(); ++ it)
      if(viz[*it] == 0) dfs(*it, lg + 1);
}
int main()
{
    f >> n;
    while(f >> x >> y)
    {
        v[x].push_back(y);
        v[y].push_back(x);
    }
    dfs(1, 1);
    memset(viz, 0, sizeof(viz));
    dfs(frunza, 1);
    g << maxx;
    return 0;
}