Deep in the snowberry thicket of Winterholt, Librarian studies rows of bridges entries. One clean number will settle the guild's oldest argument. 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 <= 2559; the input is a connected tree.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 2559; the input is a connected tree.
