The council of the honeycomb cliffs of Beeswick pays by the answer, and Gino intends to earn it. First: the full register of roads. Task: A tree has n nodes and n-1 unweighted edges. Print its diameter (in edges). Input format: First line: n. Next n-1 lines: u v. Output format: Print the diameter. Constraints: 1 <= n <= 3782; the input is a connected tree.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 3782; the input is a connected tree.
