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

using namespace std;

int main()
{
    int n, i, temp1, temp2;
    cin >> n;

    vector<vector<int>> connections(n);
    vector<bool> been(n, 0);

    for (i = 1; i < n; i++)
    {
        cin >> temp1 >> temp2;
        temp1--, temp2--;

        connections[temp1].push_back(temp2);

        been[temp2] = true;
    }

    queue<int> steps;

    for (i = 0; i < n; i++)
    {
        if (!been[i])
        {
            steps.push(i);
            break;
        }
    }

    while (steps.size() > 0)
    {
        for (i = 0; i < connections[steps.front()].size(); i++)
        {
            steps.push(connections[steps.front()][i]);
        }

        if (steps.size() == 1)
        {
            cout << steps.front() + 1;
            return 0;
        }

        steps.pop();
    }
}
//8
//1 4
//5 7
//8 6
//8 5
//3 1
//3 2
//3 8