#include <fstream>
#include <queue>
#include <cstring>
#include <vector>
using namespace std;
ifstream cin("darb.in");
ofstream cout("darb.out");
int n;
vector<int> v[100001];
int ans;
queue<int> q;
int use[100001];
int last;
void bfs(int pos)
{
    q.push(pos);
    memset(use,0,sizeof(use));
    use[pos]=1;

    while(q.size()>0)
    {
        for(int i=0;i<v[q.front()].size();i++)
        {
            if(use[v[q.front()][i]]==0)
            {
                q.push(v[q.front()][i]);
                use[v[q.front()][i]]=use[q.front()]+1;
                last=v[q.front()][i];
                ans=use[v[q.front()][i]];
            }

        }

        q.pop();
    }
}
int main()
{
    int x,y;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>x>>y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    bfs(1);
    bfs(last);
    cout<<ans;
    return 0;
}