Codeforces Round 897 (Div. 2) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

brute force

constructive algorithms

dfs and similar

greedy

hashing

*2700

No tag edit access

The problem statement has recently been changed. View the changes.

×
F. Most Different Tree

time limit per test

4 secondsmemory limit per test

512 megabytesinput

standard inputoutput

standard outputGiven a tree with $$$n$$$ vertices rooted at vertex $$$1$$$, denote it as $$$G$$$. Also denote $$$P(G)$$$ as the multiset of subtrees of all vertices in tree $$$G$$$. You need to find a tree $$$G'$$$ of size $$$n$$$ rooted at vertex $$$1$$$ such that the number of subtrees in $$$P(G')$$$ that are isomorphic to any subtree in $$$P(G)$$$ is minimized.

A subtree of vertex $$$v$$$ is a graph that contains all vertices for which vertex $$$v$$$ lies on the path from the root of the tree to itself, as well as all edges between these vertices.

Two rooted trees are considered isomorphic if it is possible to relabel the vertices of one of them so that it becomes equal to the other, with the root of the first tree receiving the number of the root of the second tree.

Input

The first line contains a single integer $$$n$$$ ($$$2 \le n \le 10^6$$$) - the number of vertices in tree $$$G$$$. Each of the next $$$n-1$$$ lines contains two integers $$$a$$$ and $$$b$$$ $$$(1 \leq a,b \leq n)$$$, indicating that there is an edge between vertices $$$a$$$ and $$$b$$$ in the tree.

Output

Output $$$n-1$$$ lines, each line containing two numbers $$$a$$$, $$$b$$$ $$$(1 \leq a,b \leq n)$$$ - the edges of tree $$$G'$$$. If there are multiple optimal answers, output any.

Examples

Input

2 1 2

Output

1 2

Input

3 1 2 1 3

Output

1 2 2 3

Input

4 1 2 1 3 3 4

Output

1 2 2 3 3 4

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/25/2024 04:11:47 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|