VeedPal has been given a tree with N vertices.
For a rooted tree, the cost of a node is defined as the size of its subtree. Now the cost of the tree is defined as the sum of the cost of all the nodes.
VeedPal is assigned the task of finding a node which when rooted gives the minimum cost of the tree.
Since Veedpal is too lazy to code, he asks you for help.
If there exist multiple answers print the node with the minimum index.
1 <= N <= 1000
First-line contains integer N (number of vertices)
Next, N - 1 lines contain u and v such that there is an edge between u and v