#include <bits/stdc++.h>
#define MULTI int _; cin >> _; while(_--)
#define fi first
#define se second
#define pb(a) push_back(a)
#define rep(i, n) for(int i = 0; i < n; i++)
#define reps(i, n, m) for(int i = n; i <= m; i++)
#define repsv(i, n, m) for(int i = n; i >= m; i--)
#define vsz(a) (int)(a.size())
#define mp(a, b) make_pair(a, b)
#define all(a) a.begin(), a.end()

using namespace std;

typedef pair<double, double> pdd;
typedef pair<int, int> pii;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vll;

#ifdef LOCAL
#include "debugs.hpp"
#else
#define dbg(...) 0
#endif

vector<vi> g;
vector<unordered_map<int, int>> dp; // largeur de l'arbe en enlevant tel parent
int n;

int calc(int i, int p){ // noeud i en enlevant le parent p
    if(dp[i].count(p))
        return dp[i][p];
    int res = 1; // self
    for(int j : g[i])
        if(j!=p)
            res += calc(j, i);
    return dp[i][p] = res;
}

void dfs(int i, vector<bool> & vu, int k){
    if(i >= k) return;
    vu[i] = true;
    for(int j : g[i])
        if(!vu[j])
            dfs(j, vu, k);
}

bool test(int k){
    reps(i, k, n-1){
        if(g[i].size()==1)
            return true;
        for(int j : g[i])
            if(j>=k)
                return true;
    }
    vector<bool> vu(n);
    rep(i, n)
        if(g[i].size()==1)
            dfs(i, vu, k);
    int s = 0;
    reps(i, k, n-1){
        bool ok = false;
        for(int j : g[i])
            if(vu[j])
                ok = true;
        if(ok)
            for(int j : g[i])
                if(!vu[j])
                    s += calc(i, j)-1;
    }
    // dbg(k, s);
    if(s%2==0) return false;
    else return true;
}

void solve(){
    cin >> n;
    g = vector<vi>(n);
    dp = vector<unordered_map<int,int>>(n);
    rep(i, n-1){
        int a, b;
        cin >> a >> b;
        g[a-1].pb(b-1);
        g[b-1].pb(a-1);
    }
    // rep(i, n){bool t = test(i); cerr << i << " : " << t << '\n';}
    int l = 0, r = n-1;
    while(r-l>1){
        int m = (l+r)/2;
        if(test(m))
            l = m;
        else
            r = m-1;
    }
    if(test(r)) cout << r+1 << '\n';
    else cout << l+1 << '\n';
}

int main(){
    ios_base::sync_with_stdio(false);
    // MULTI
    solve();
}