PROGRAMMING:The deepest root in the graph

A connected acyclic graph can be regarded as a tree, but if you choose different nodes as roots, the structure of the tree will be different, and the height of the tree will be different. Now you need to find the root that can form the highest tree, that is, the deepest root.
###Input format:
First, the number of nodes n is given in the first line, n is less than 10000, and the nodes are numbered from 1, then n-1 lines are given in turn.
###Output format:
For each group of inputs, output the number of the deepest root. If there are more than one, output it in the order from small to large, one for each line. If the tree cannot be constructed, the number of connected blocks in the graph is counted and "error: K components" is output, where k is the number of connected blocks.
###Input sample 1:
Here is a set of inputs. For example:
```in
five
1 2
1 3
1 4
2 5
```
###Output sample 1:
The corresponding output is given here. For example:
```out
three
four
five
```
###Input sample 2:
Here is a set of inputs. For example:
```in
five
1 3
1 4
2 5
3 4
```
###Output sample 2:
The corresponding output is given here. For example:
```out
Error: 2 components
```







answer：If there is no answer, please comment