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

using namespace std;

int BFS(vector<vector<int>> &adj, int start, int N)
{
    queue<int> q;
    q.push(start);
    vector<bool> visited(N+1, false);
    visited[start] = true;
    int utolso = start;
    while(!q.empty()){
        int currNode = q.front();
        q.pop();
        visited[currNode] = true;
        utolso = currNode;

        for(int i = 0; i < adj[currNode].size(); i++){
            int newNode = adj[currNode][i];
            if(!visited[newNode]){
                q.push(newNode);
            }
        }
    }
    return utolso;
}

int main()
{
    int N;
    cin >> N;
    vector<vector<int>> adj(N+1);
    vector<bool> van_bejovo(N+1, false);

    for(int i = 1; i < N; i++){
        int a, b;
        cin >> a >> b;
        adj[a].push_back(b);
        van_bejovo[b] = true;
    }
    int start;
    for(int i = 1; i <= N; i++){
        if(!van_bejovo[i]){
            start = i;
            break;
        }
    }

    cout << BFS(adj, start, N);
    return 0;
}