#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 1e5 + 10;

int n, deg[MAXN];
vector <int> e[MAXN];

ll ans1, ans2;
int res1[MAXN], res2[MAXN];

int vis1[MAXN], asg[MAXN];
bool DFS1(int u, int fa)
{
    for (auto v : e[u])
        if (v != fa)
            if (!DFS1(v, u)) vis1[u] = 1, asg[v] = u;
    return vis1[u];
}

int nr[MAXN], top;
inline void Solution1()
{
    DFS1(1, 0);
    for (int i = 1; i <= n; i++)
        if (vis1[i] == 1)
        {
            nr[top = 1] = i;
            // cout << i << "\n";
            for (auto v : e[i])
                if (!vis1[v] && (!asg[v] || asg[v] == i)) nr[++top] = v;
            for (int j = 1; j <= top; j++) res1[nr[j]] = nr[(j == top ? 1 : j + 1)], vis1[nr[j]] = 2;
            ans1 += (top - 1) * 2;
        }
    // cout << ans1 << "\n";
    // for (int i = 1; i <= n; i++) cout << res1[i] << " ";
    // cout << "\n";
}

int sz[MAXN], rt;
void DFS2(int u, int fa)
{
    sz[u] = 1;
    int mx = 0;
    for (auto v : e[u])
        if (v != fa)
        {
            DFS2(v, u), sz[u] += sz[v], mx = max(mx, sz[v]);
            ans2 += 2 * min(sz[v], n - sz[v]);
        }
    mx = max(mx, n - sz[u]);
    if (mx <= n / 2) rt = u;
}
vector <int> vt[MAXN];
int rrt;
void DFS3(int u, int fa)
{
    vt[rrt].push_back(u);
    sz[u] = 1;
    for (auto v : e[u])
        if (v != fa) DFS3(v, u), sz[u] += sz[v];
}
priority_queue < pair <int, int> > q;
inline void Solution2()
{
    DFS2(1, 0);
    int mn = 2e9;
    for (auto u : e[rt]) rrt = u, DFS3(u, rt), mn = min(mn, sz[u]);
    for (auto u : e[rt])
        if (sz[u] == mn) {sz[u]++, vt[u].push_back(rt), swap(vt[u][0], vt[u][vt[u].size() - 1]); break;}
    for (auto u : e[rt]) q.push(make_pair(sz[u], u));//, cout << sz[u] << " ";
    // cout << "\n";
    int rem = n;
    while (!q.empty())
    {
        int u = q.top().second;
        if (sz[u] == 1 || rem <= 3)
        {
            top = 0;
            for (auto v : vt[u]) nr[++top] = v;
            q.pop();
            while (!q.empty())
            {
                u = q.top().second, q.pop();
                for (auto v : vt[u]) nr[++top] = v;
            }
            for (int i = 1; i <= top; i++) res2[nr[i]] = (i == top ? nr[1] : nr[i + 1]);//, cout << nr[i] << " ";
            // cout << "\n";
            break;
        }
        q.pop();
        int v = q.top().second; q.pop();
        int x = vt[u][vt[u].size() - 1], y = vt[v][vt[v].size() - 1];
        // cout << x << " " << y << "\n";
        sz[u]--, sz[v]--, vt[u].pop_back(), vt[v].pop_back();
        // cout << sz[u] << " " << sz[v] << "\n";
        res2[x] = y, res2[y] = x, rem -= 2;
        q.push(make_pair(sz[u], u)), q.push(make_pair(sz[v], v));
    }
    // cout << ans2 << "\n";
    // for (int i = 1; i <= n; i++) cout << res2[i] << " ";
    // cout << "\n";
}

int main()
{
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(n);
    for (int i = 1, u, v; i < n; i++) Read(u), Read(v), e[u].push_back(v), e[v].push_back(u), deg[u]++, deg[v]++;
    Solution1();
    Solution2();
    cout << ans1 << " " << ans2 << "\n";
    for (int i = 1; i <= n; i++) cout << res1[i] << " "; cout << "\n";
    for (int i = 1; i <= n; i++) cout << res2[i] << " "; cout << "\n";
    return 0;
}