#include <iostream>
#include <vector>

using namespace std;

struct Vertex {
	int parent = -1;
	vector<int> children;
};

int P;
Vertex vertices[100001];

// w - i
pair<int, int> f(int i) {
	if (vertices[i].children.empty()) return { 0, i };
	
	int mx = -1;
	int mxi = -1;
	for (int child : vertices[i].children) {
		auto fchild = f(child);
		if (fchild.first > mx) {
			mx  = fchild.first;
			mxi = fchild.second;
		}
	}

	return { mx + 1, mxi };
}

int main() {
	int N;
	cin >> N;

	for (int i = 1, p, c; i < N; i++) {
		cin >> p >> c;
		//p--; c--;
		vertices[p].children.push_back(c);
		vertices[c].parent = p;
	}

	for (int i = 1; i < N; i++) {
		if (vertices[i].parent == -1) {
			P = i;
			break;
		}
	}

	cout << f(P).second << "\n";

	return 0;
}