#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, s, d[200010], c = 0, a[200010];
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	s = n;
	for (ll i = 1, x, y; i < n; i++) {
		cin >> x >> y;
		d[x]++;
		d[y]++;
	}
	for (ll i = 1; i <= n; i++)
		if (d[i] >= 3) {
			a[++c] = d[i];
			s -= d[i] + 1;
		}
	for (ll i = 1; i <= s / 3; i++)
		a[++c] = 2;
	sort(a + 1, a + c + 1);
	for (ll i = 1; i <= c; i++)
		cout << a[i] << ' ';
	return 0;
}

黄题=27行代码？建议降橙