#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int N;
int A[200000], B[200000];
vector<int> e[100000];

int doubling[100000][20];
int depth[100000];
set<pair<int, int>> used;
void calc(int i, int v) {
  depth[i] = depth[v] + 1;
  doubling[i][0] = v;
  for (int j = 1; j < 20; j++) {
    if (doubling[i][j - 1] == -1) {
      doubling[i][j] = -1;
    } else {
      doubling[i][j] = doubling[doubling[i][j - 1]][j - 1];
    }
  }
  used.insert({min(v, i), max(v, i)});
}
void dfs(int v) {
  for (auto i : e[v]) {
    if (doubling[i][0] != -2) continue;
    calc(i, v);
    dfs(i);
  }
}

int lca(int a, int b) {
  if (depth[a] < depth[b]) swap(a, b);
  while (depth[a] > depth[b]) {
    int j = 0;
    int d = 1;
    while (d * 2 <= depth[a] - depth[b]) {
      j++;
      d <<= 1;
    }
    a = doubling[a][j];
  }
  while (a != b) {
    int j = 0;
    while (doubling[a][j + 1] != doubling[b][j + 1]) j++;
    a = doubling[a][j];
    b = doubling[b][j];
  }
  return a;
}

int dist(int a, int b) {
  return depth[a] + depth[b] - 2 * depth[lca(a, b)];
}

void print_path(int a, int b) {
  int l = lca(a, b);
  while (a != l) {
    cout << a + 1 << " ";
    a = doubling[a][0];
  }
  cout << l + 1;
  vector<int> ans;
  while (b != l) {
    ans.push_back(b);
    b = doubling[b][0];
  }
  reverse(ans.begin(), ans.end());
  for (auto i : ans) cout << " " << i + 1;
}

int main() {
  cin >> N;
  for (int i = 0; i < 2 * N - 3; i++) {
    cin >> A[i] >> B[i];
    A[i]--;
    B[i]--;
    if (A[i] > B[i]) swap(A[i], B[i]);
    e[A[i]].push_back(B[i]);
    e[B[i]].push_back(A[i]);
  }

  for (int i = 0; i < N; i++) doubling[i][0] = -2;
  for (int i = 0; i < N; i++) {
    if (e[i].size() >= 3 && doubling[i][0] == -2) {
      for (int j = 0; j < 20; j++) doubling[i][j] = -1;
      calc(e[i][0], i);
      calc(e[i][1], i);
      calc(e[i][2], i);
      dfs(e[i][0]);
      dfs(e[i][1]);
      dfs(e[i][2]);
      dfs(i);
    }
  }

  vector<int> inv_dist(N, -1);
  for (int i = 0; i < 2 * N - 3; i++) {
    if (used.contains({A[i], B[i]})) continue;
    int d = dist(A[i], B[i]);
    if (d <= 1) continue;
    if (inv_dist[d] == -1) {
      inv_dist[d] = i;
    } else {
      cout << d + 1 << endl;
      // cerr << A[i] << " " << B[i] << " " << A[inv_dist[d]] << " " << B[inv_dist[d]] << endl;
      print_path(A[i], B[i]);
      cout << endl;
      print_path(A[inv_dist[d]], B[inv_dist[d]]);
      cout << endl;
      break;
    }
  }
}