#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <string.h>

#define MAX_N 1000001

using namespace std;
int n, m, i, x, y, viz[MAX_N];
ifstream f("darb.in");
ofstream g("darb.out");

vector<int> adj[MAX_N];

int G[MAX_N];


int nivMax = 0;
int poz = 0;
void DFS(int nod, int nivel){
    viz[nod] = 1;
    if (nivel > nivMax){
        nivMax = nivel;
        poz = nod;
    }
    for (int i=0; i<G[nod]; i++)
        if (viz[adj[nod][i]] == 0)
            DFS(adj[nod][i], nivel+1);
}

int main()
{
    f >> n;
    for (i=1; i<n; i++){
        f >> x >> y;
        adj[x].push_back(y);
    	adj[y].push_back(x);
    }

    for (i = 1; i <= n; i++)
	G[i] = adj[i].size();

    DFS(1,1);

    for (i=1; i<=n; i++)
        viz[i] = 0;
    DFS(poz,1);
    g << nivMax;
    return 0;
}