#include <iostream>
#include <vector>
#include <functional>

using namespace std;

const int N = 1e5 + 3;

vector<int> adj[N];
int n;

bool check(int mid){
    int d = -1;
    bool ok = true;

    function<void(int, int, int)> dfs = [&](int u, int p, int depth){
        if(u >= mid){
            if(d == -1){
                d = depth;
            }
            else{
                if(d != depth){
                    ok = false;
                }
            }
        }

        for(int to: adj[u]){
            if(to == p) continue;
            dfs(to, u, depth ^ 1);
        }
    };

    dfs(1, -1, 0);
    return ok;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n;
    for(int i = 0; i < n - 1; ++i){
        int x, y;
        cin >> x >> y;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }

    if(n % 2 == 0){
        cout << n << "\n";
        return 0;
    }

    int l = 1, r = n;
    for(int i = 1; i <= n; ++i){
        if(adj[i].size() == 1){
            l = max(l, i);
        }
    }

    while(l != r){
        int mid = (l + r + 1) / 2;
        if(check(mid)) l = mid;
        else r = mid - 1;
    }

    cout << l << "\n";
}