import java.util.Scanner;

public class StarGraphCenter {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = 0;

        // Input for the number of nodes
        try {
            n = Integer.parseInt(scanner.nextLine());
        } catch (NumberFormatException e) {
            System.out.println("Invalid input");
            return;
        }

        // Validate the range of n
        if (n < 2 || n > 100) {
            System.out.println("Invalid input");
            return;
        }

        int[][] edges = new int[n - 1][2];
        
        // Input for edges
        for (int i = 0; i < n - 1; i++) {
            String edgeInput = scanner.nextLine();
            String[] nodes = edgeInput.split(" ");
            if (nodes.length != 2) {
                System.out.println("Invalid input");
                return;
            }
            try {
                edges[i][0] = Integer.parseInt(nodes[0]);
                edges[i][1] = Integer.parseInt(nodes[1]);
            } catch (NumberFormatException e) {
                System.out.println("Invalid input");
                return;
            }
        }

        // Determine the center of the star graph
        int center = findCenter(edges);
        System.out.println(center);
    }

    private static int findCenter(int[][] edges) {
        // Assuming the center is connected to at least two nodes.
        if (edges[0][0] == edges[1][0] || edges[0][0] == edges[1][1]) {
            return edges[0][0];
        } else {
            return edges[0][1];
        }
    }
}