#include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 200005
#define endl '\n'
int n, ctr = -1, cnt = 0, tot, si[N] = {0};
bool del[N], vis[N];
vector<int> e[N], ans[N];
void dfs(int u, int fa = 0)
{
    si[u] = 1;
    int mss = 0;
    for (auto to : e[u])
        if (!del[to] && to != fa)
        {
            dfs(to, u);
            if (ctr != -1)
                return;
            si[u] += si[to];
            mss = max(mss, si[to]);
        }
    mss = max(mss, tot - si[u]);
    if (mss <= tot / 2)
    {
        ctr = u;
        si[fa] = tot - si[u];
    }
}
void dfs2(int u, int fa)
{
    bool check = 0;
    for (auto to : e[u])
        if (!vis[to] && !del[to] && to != fa)
        {
            check = 1;
            dfs2(to, u);
        }
    if (!check)
    {
        if (u == -1)
        {
            cout << u << ' ' << fa << endl;
        }
        ans[cnt].push_back(u);
        del[u] = 1;
    }
}
void func(int u)
{
    cnt++;
    bool ok = 1;
    for (auto to : e[u])
        if (!del[to] && !vis[to])
        {
            ok = 0;
            dfs2(to, u);
        }
    if (ok)
        cnt--;
    vis[u] = 1;
    for (auto to : e[u])
        if (!del[to] && !vis[to])
        {
            tot = si[to];
            ctr = -1;
            dfs(to);
            func(ctr);
        }
    if (!del[u])
    {
        del[u] = 1;
        ans[++cnt].push_back(u);
    }
}
signed main()
{
    cin >> n;
    for (int i = 1; i < n; i++)
    {
        int u, v;
        cin >> u >> v;
        e[u].push_back(v);
        e[v].push_back(u);
    }
    tot = n;
    ctr = -1;
    dfs(1, 0);
    func(ctr);
    cout << cnt << endl;
    for (int i = 1; i <= cnt; cout << endl, i++)
    {
        cout << ans[i].size() << ' ';
        for (auto v : ans[i])
            cout << v << ' ';
    }
    return 0;
}