#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;

const int N = 2e5;
int n;
int e[N],ne[N],h[N],idx;
bool op[N];
int res = N;
void add(int a,int b){
    e[idx] = b;
    ne[idx] = h[a];
    h[a] = idx ++;
}

int dfs(int aa){
    op[aa] = true;
    int re = 0,summ = 1;
    for(int i = h[aa]; i != -1; i = ne[i]){
        int uu = e[i];
        if(!op[uu]){
            int rr = dfs(uu);
            re = max(re,rr);
            summ += rr;
        }
    }
    re = max(re,n - summ);
    res = min(res,re);
    return summ;
}

int main(){
    cin >> n;
    memset(h,-1,sizeof h);
    for(int i = 1; i <= n - 1; i ++){
        int a,b;
        cin >> a >> b;
        add(a,b);
        add(b,a);
    }
    dfs(1);
    cout << res << "\n";
}