tioj 1947

using namespace std;
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <utility>
#include <bitset>
#include <set>
#include <string>
#include <stack>
#include <iomanip>
#include <map>

#define pb push_back
#define pii pair<int,int>
#define F first
#define S second
#define LL long long
#define mid (LB+RB)/2
#define iter(x) x.begin(),x.end()

/*
yungyao so weeeeeeeeeeeeeeeeeeeeeeeeeeak
8e7 so dian
FHVirus so dian
youou so dian
KYW so dian
hubert so dian
jass so dian
tingyu so dian
panda so dian
*/

//IO
#include <iostream>
#define theyRSOOOOOOOOODIAN ios_base::sync_with_stdio(false),cin.tie(0);
#define endl '\n'

//workspace

vector <int> tree[1000100];
int deg[1000100],subSize[1000100];
pii mxSub[1000100];

int n;
void dfs1(int x,int fr){
    mxSub[x].F = x;
    for (auto i:tree[x]){
        if (i == fr)
            continue;

        dfs1(i,x);
        if (subSize[i] > mxSub[x].S)
            mxSub[x] = {i,subSize[i]};
        subSize[x] += subSize[i];
    }
    for (auto i:tree[x]){
        if (i != fr){
            if (n - subSize[x] > mxSub[i].S)
                mxSub[i] = {x,n-subSize[x]};
        }
    }
    ++subSize[x];
}

int dfs2(int x){
    if (mxSub[x].S > n/2)
        return dfs2(mxSub[x].F);
    return mxSub[x].S;
}

int main(){
    theyRSOOOOOOOOODIAN
    cin >> n;
    for (int i=1;i<n;++i){
        int u,v;

        cin >> u >> v;
        ++deg[u];
        ++deg[v];
        tree[u].pb(v);
        tree[v].pb(u);
    }

    for (int i=0;;++i){
        if (deg[i] == 1){
            dfs1(i,-1);
            cout << dfs2(i) << '\n';
            break;
        }
    }

    //for (int i=0;i<n;++i) cout << i << ' ' << mxSub[i].F << ' ' << mxSub[i].S << '\n';

    return 0;
}