Ramesses knows a lot about problems involving trees (undirected connected graphs without cycles)!
He created a new useful tree decomposition, but he does not know how to construct it, so he asked you for help!
The decomposition is the splitting the edges of the tree in some simple paths in such a way that each two paths have at least one common vertex. Each edge of the tree should be in exactly one path.
Help Remesses, find such a decomposition of the tree or derermine that there is no such decomposition.
Input
The first line contains a single integer $n$ ($2 \leq n \leq 10^{5}$) the number of nodes in the tree.
Each of the next $n - 1$ lines contains two integers $a_i$ and $b_i$ ($1 \leq a_i, b_i \leq n$, $a_i \neq b_i$) — the edges of the tree. It is guaranteed that the given edges form a tree.
Output
If there are no decompositions, print the only line containing “No”.
Otherwise in the first line print “Yes”, and in the second line print the number of paths in the decomposition $m$.
Each of the next $m$ lines should contain two integers $u_i$, $v_i$ ($1 \leq u_i, v_i \leq n$, $u_i \neq v_i$) denoting that one of the paths in the decomposition is the simple path between nodes $u_i$ and $v_i$.
Each pair of paths in the decomposition should have at least one common vertex, and each edge of the tree should be presented in exactly one path. You can print the paths and the ends of each path in arbitrary order.
If there are multiple decompositions, print any.
Examples
input
4
1 2
2 3
3 4
output
Yes
1
1 4
input
6
1 2
2 3
3 4
2 5
3 6
output
No
input
5
1 2
1 3
1 4
1 5
output
Yes
4
1 2
1 3
1 4
1 5
Note
The tree from the first example is shown on the picture below:
The number next to each edge corresponds to the path number in the decomposition. It is easy to see that this decomposition suits the required conditions.
The tree from the second example is shown on the picture below:
We can show that there are no valid decompositions of this tree.
The tree from the third example is shown on the picture below:
The number next to each edge corresponds to the path number in the decomposition. It is easy to see that this decomposition suits the required conditions.
Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> deg(n);
for (int i = 0; i < n - 1; i++) {
int x, y;
cin >> x >> y;
x--; y--;
deg[x]++;
deg[y]++;
}
vector<vector<int>> by_deg(n + 1);
int mx = 0;
for (int i = 0; i < n; i++) {
by_deg[deg[i]].push_back(i);
mx = max(mx, deg[i]);
}
if (mx <= 2) {
cout << "Yes" << '\n';
cout << 1 << '\n';
cout << by_deg[1][0] + 1 << " " << by_deg[1][1] + 1 << '\n';
return 0;
}
int cc = 0;
int who = -1;
for (int i = 0; i < n; i++) {
if (deg[i] > 2) {
cc++;
who = i;
}
}
if (cc > 1) {
cout << "No" << '\n';
return 0;
}
cout << "Yes" << '\n';
cout << by_deg[1].size() << '\n';
for (int i : by_deg[1]) {
cout << who + 1 << " " << i + 1 << '\n';
}
return 0;
}
