Every season at the obsidian flows of Blackglass, someone must plan the festival budget. This year the task falls to Ojas, armed only with the routes register. 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 <= 2550; the input is a connected tree.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 2550; the input is a connected tree.
