#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 10;
const int INF = 0x3f3f3f3f;
int n;
int dp[MAXN], vis[MAXN], ans[MAXN];
vector<int> e[MAXN], pe[MAXN];
struct Node {
  int u, v;
  Node(int a, int b) { u = a, v = b; }
  friend bool operator<(Node x, Node y) {
    if (x.u == y.u) return x.v < y.v;
    return x.u < y.u;
  }
};
map<Node, bool> rbt;
void Init() {
  memset(dp, 0, sizeof(dp));
  memset(vis, 0, sizeof(vis));
  for (int i = 0; i < MAXN; i++) e[i].clear();
  for (int i = 0; i < MAXN; i++) pe[i].clear();
  rbt.clear();
}
int DFS(int u, int pre, bool f) {
  int sum = 0;
  for (int i = 0; i < (int)e[u].size(); i++) {
    int v = e[u][i];
    if (v == pre) continue;
    Node tmp = Node(u, v);
    sum += DFS(v, u, rbt[tmp]);
  }
  if (!f) {
    dp[u] = -1;
    return sum + 1;
  }
  dp[u] = 1;
  return sum;
}
void GetAns(int u, int pre) {
  for (int i = 0; i < (int)e[u].size(); i++) {
    int v = e[u][i];
    if (v == pre) continue;
    dp[v] += dp[u];
    GetAns(v, u);
  }
}
int main() {
  while (~scanf("%d", &n)) {
    Init();
    int a, b;
    for (int i = 0; i < n - 1; i++) {
      scanf("%d%d", &a, &b);
      Node tmp = Node(a, b);
      rbt[tmp] = true;
      e[a].push_back(b);
      e[b].push_back(a);
    }
    dp[1] = DFS(1, -1, 1);
    GetAns(1, -1);
    int mn = INF;
    for (int i = 1; i <= n; i++) mn = min(mn, dp[i]);
    printf("%d\n", mn);
    for (int i = 1; i <= n; i++) {
      if (mn == dp[i]) {
        printf("%d ", i);
      }
    }
    puts("");
  }
  return 0;
}
