// UUID: 78510bb9-bfe4-4b3e-81c2-9fb1304e2d9e
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    cin >> N;
    vector<vector<int>> children(N + 1);
    vector<int> hasParent(N + 1, 0);

    for (int i = 0; i < N - 1; i++) {
        int parent, child;
        cin >> parent >> child;
        children[parent].push_back(child);
        hasParent[child] = 1;
    }
    int root = 1;
    for (int i = 1; i <= N; i++) {
        if (!hasParent[i]) {
            root = i;
            break;
        }
    }
    queue<pair<int, int>> q;
    q.push({root, 0});
    int farthestNode = root;
    int maxDepth = 0;
    while (!q.empty()) {
        auto [u, depth] = q.front();
        q.pop();
        if (depth > maxDepth) {
            maxDepth = depth;
            farthestNode = u;
        }
        for (int v : children[u]) {
            q.push({v, depth + 1});
        }
    }
    cout << farthestNode << "\n";
    return 0;
}