#include <bits/stdc++.h>
using namespace std;

const int N = 100005;
int n, e[2 * N], ne[2 * N], h[N], idx;
int ans = N;
bool vis[N];

void add (int a, int b) {
    e[idx] = b; ne[idx] = h[a]; h[a] = idx++;
}

int dfs (int u) {
    vis[u] = true;

    int sum = 1, res = 0;
    for (int i = h[u]; i != -1; i = ne[i]) {
        int j = e[i];
        if (!vis[j]) {
            int s = dfs(j);
            res = max(res, s);
            sum += s;
        }
    }

    res = max(res, n - sum);
    ans = min(ans, res);

    return sum;
}

int main (void) {
    int a, b;
    cin >> n;
    memset(h, -1, sizeof(h));
    for (int i = 0; i < n - 1; i++) {
        cin >> a >> b;
        add(a, b); add(b, a);
    }

    dfs(1);

    cout << ans << endl;

    return 0;
}