#include <iostream>
#include <vector>
#include <unordered_map>
#include <queue>
using namespace std;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n;
    cin >> n;
    unordered_map<int, int> m;
    vector<vector<int>> vec(n+1, vector<int>(0, 0));
    for (size_t i = 0; i < n-1; i++)
    {
        int a, b;
        cin >> a >> b;
        vec[a].push_back(b);
        m[b]++;
    }
    int kezdet = 0;
    for (size_t i = 1; i < n+1; i++)
    {
        if (m[i] == 0)
        {
            kezdet = i;
            break;
        }
    }
    vector<bool> visited(n + 1, false);
    visited[kezdet] = true;
    queue<int> q;
    int s = kezdet;
    q.push(kezdet);
    while (!q.empty())
    {
        s = q.front();
        q.pop();
        for (int i : vec[s])
        {
            if (!visited[i])
            {
                visited[i] = true;
                q.push(i);
            }
        }
    }
    cout << s << endl;
}
/*
8
1 4
5 7
8 6
8 5
3 1
3 2
3 8
*/