#include <bits/stdc++.h> using namespace std; vector children[25]; int max_depth = 1; void dfs(int node, int depth) { max_depth = max(max_depth, depth); for (int child : children[node]) { dfs(child, depth + 1); } } int main() { int n; cin >> n; for (int i = 0; i < n - 1; ++i) { int a, b; cin >> a >> b; children[a].push_back(b); } dfs(1, 1); cout << max_depth; return 0; }