ABC 303

void solve() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vvint graph(n);
    rep(i, n - 1) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        graph[u].push_back(v);
        graph[v].push_back(u);
    }

    vint sz;

    auto dfs = [&](auto dfs, int now, int p, int label) -> void {
        if (label == 1) {
            sz.push_back(graph[now].size());
        }

        for (int nx : graph[now]) {
            if (nx == p)
                continue;
            dfs(dfs, nx, now, (label + 1) % 3);
        }
    };

    rep(i, n) if (graph[i].size() == 1) {
        dfs(dfs, i, -1, 0);
        break;
    }

    sort(all(sz));
    print(sz);
}