#include<fstream>
using namespace std;
ifstream f("darb.in");
ofstream g("darb.out");
int viz[100001], n,j;
struct pizza
{
	int a, b;
}m[100001];
void dfs(int x, int ad)
{
	int i;
	viz[x] = ad;
	for (i = 1; i <= j; i++)
	{
		if (m[i].a == x && !viz[m[i].b])
			dfs(m[i].b, ad + 1);
	}
}
int main()
{
	int i=0, x, y,mx=0,ind;
	f >> n;
	while (f >> x >> y)
	{
		j++;
		m[j].a = x;
		m[j].b = y;
		j++;
		m[j].a = y;
		m[j].b = x;
	}
	dfs(1, 1);
	for (i = 1; i <= n; i++)
		if (viz[i] > mx)
		{
			mx = viz[i];
			ind = i;
		}
	for (i = 1; i <= n; i++)viz[i] = 0;
	dfs(ind, 1);
	for (i = 1; i <= n; i++)
		if (viz[i] > mx)mx = viz[i];
	g << mx;
}