import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Map;
import java.util.Queue;

public class Main {

  static Map<Integer, ArrayList<Integer>> graph = new HashMap<>();
  static HashSet<Integer> visited = new HashSet<>();
  static int[] location;

  public static void main(String[] args) throws IOException {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    int count = Integer.parseInt(br.readLine());
    for (int i = 0; i < count - 1; i++) {
      int[] edge = Arrays.stream(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
      graph.putIfAbsent(edge[0], new ArrayList<>());
      graph.putIfAbsent(edge[1], new ArrayList<>());
      graph.get(edge[0]).add(edge[1]);
      graph.get(edge[1]).add(edge[0]);
    }

    location = new int[count + 1];
    bfs();
    for (int i = 2; i < location.length; i++) {
      System.out.println(location[i]);
    }
  }

  public static void bfs() {
    Queue<Integer> queue = new LinkedList<>();
    queue.add(1);
    visited.add(1);

    while (!queue.isEmpty()) {
      Integer poll = queue.poll();
      for (int neighbor : graph.get(poll)) {
        if (!visited.contains(neighbor)) {
          location[neighbor] = poll;
          queue.add(neighbor);
          visited.add(neighbor);
        }
      }
    }
  }

}