YOU SAID:

Find the center of gravity node of the tree: Use the label to define the center of gravity of the tree. For a node K, if K is deleted from the tree (along with the edges connected to it), the rest is divided into many blocks, each of which is obviously again It is a tree (that is, the remaining part constitutes a forest). Then the number marked for node K is the number of nodes owned by the tree with the largest number of nodes in the forest. If the label of node K is not greater than the label of any other node, then node K is said to be the center of gravity of the tree. The first line of input contains an integer N (1 outputs two lines, the first line has two integers v, T, where v represents the label of the barycentric node of the tree, T represents how many centers of gravity the tree has, and the second line contains T The number is the number of the center of gravity of all trees, arranged in ascending order.

INTO JAPANESE

ツリーの重心ノードを見つける：ラベルを使用して、ツリーの重心を定義します。ノードKの場合、Kがツリーから削除されると（それに接続されているエッジとともに）、残りは多くのブロックに分割され、各ブロックは明らかに再びツリーになります（つまり、残りの部分はフォレストを構成します） ）。次に、マークされた番号

BACK INTO ENGLISH

Find the centroid node for the tree: Use the label to define the centroid of the tree. For node K, when K is removed from the tree (along with the edges connected to it), the rest is split into many blocks, each block apparently becoming a tree again (ie).

INTO JAPANESE

ツリーの図心ノードを見つける：ラベルを使用して、ツリーの図心を定義します。ノードKの場合、Kがツリーから削除されると（それに接続されているエッジとともに）、残りは多くのブロックに分割され、各ブロックは明らかに再びツリーになります（つまり）。

BACK INTO ENGLISH

Find the centroid node of the tree: Use the label to define the centroid of the tree. For node K, when K is removed from the tree (along with the edges connected to it), the rest is split into many blocks, each block apparently becoming a tree again (ie).

INTO JAPANESE

ツリーの図心ノードを見つける：ラベルを使用して、ツリーの図心を定義します。ノードKの場合、Kがツリーから削除されると（それに接続されているエッジとともに）、残りは多くのブロックに分割され、各ブロックは明らかに再びツリーになります（つまり）。

BACK INTO ENGLISH

Find the centroid node of the tree: Use the label to define the centroid of the tree. For node K, when K is removed from the tree (along with the edges connected to it), the rest is split into many blocks, each block apparently becoming a tree again (ie).