#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ar array
#define vt vector
#define pq priority_queue
#define pu push
#define pub push_back
#define em emplace
#define emb emplace_back
#define mt make_tuple

#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define allp(x, l, r) x.begin() + l, x.begin() + r
#define len(x) (int)x.size()
#define uniq(x) unique(all(x)), x.end()

using namespace std;
using namespace __gnu_pbds;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

template <class T, size_t N>
void re(array <T, N>& x);
template <class T> 
void re(vt <T>& x);

template <class T> 
void re(T& x) {
    cin >> x;
}

template <class T, class... M> 
void re(T& x, M&... args) {
    re(x); re(args...);
}

template <class T> 
void re(vt <T>& x) {
    for(auto& it : x)
        re(it);
}

template <class T, size_t N>
void re(array <T, N>& x) {
    for(auto& it : x)
        re(it);
}

template <class T, size_t N>
void wr(array <T, N> x);
template <class T> 
void wr(vt <T> x);

template <class T> 
void wr(T x) {
    cout << x;
}

template <class T, class ...M>  void wr(T x, M... args) {
    wr(x), wr(args...);
}

template <class T> 
void wr(vt <T> x) {
    for(auto it : x)
        wr(it, ' ');
}

template <class T, size_t N>
void wr(array <T, N> x) {
    for(auto it : x)
        wr(it, ' ');
}

template<class T, class... M>
auto mvt(size_t n, M&&... args) {
    if constexpr(sizeof...(args) == 1)
        return vector<T>(n, args...);
    else
        return vector(n, mvt<T>(args...));
}

void set_fixed(int p = 0) {
    cout << fixed << setprecision(p);
}

void set_scientific() {
    cout << scientific;
}

inline void Open(const string Name) {
    #ifndef ONLINE_JUDGE
        (void)!freopen((Name + ".in").c_str(), "r", stdin);
        (void)!freopen((Name + ".out").c_str(), "w", stdout);
    #endif
}

void solve() {
    function <pair <int, int>(int)> bfs;
    int n; re(n);
    vt <vt <int>> adj(n);
    for (int i = 0; i < n - 1; ++i) {
        int u, v; re(u, v);
        --u, --v;
        adj[u].emb(v);
        adj[v].emb(u);
    }

    bfs = [&](int u) {
        queue <int> q;
        vt <int> dp(n, -1);
        
        q.em(u);
        dp[u] = 0;
        while (len(q)) {
            int u = q.front();
            q.pop();

            for (auto& v : adj[u])
                if (dp[v] == -1) {
                    dp[v] = dp[u] + 1;
                    q.em(v);
                }
        }

        pair <int, int> res{-1, -1};
        for (int i = 0; i < n; ++i)
            if (dp[i] > res.first) {
                res.first = dp[i];
                res.second = i;
            }
        return res;
    };

    wr(bfs(bfs(0).second).second + 1);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    Open("darb");

    int t = 1;
    for(;t;t--) {
        solve();
    }
    
    return 0;
}