#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <map>
#include <cmath>
#include <cstring>
#include <vector>
#include <bitset>

template <typename Tp>
inline void read(Tp &x) {
    x = 0;
    bool f = true; char ch = getchar();
    for ( ; ch < '0' || ch > '9'; ch = getchar()) f ^= ch == '-';
    for ( ; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + (ch ^ 48);
    x = f ? x : -x;
}

const int N = 2e5, M = 50;

int dp[N + 5][M + 5], siz[N + 5];
std::vector<int> Vec[N + 5];

void dfs(int u, int ff) {
    siz[u] = 1;
    int v1 = 0, v2 = 0;
    for (int v : Vec[u]) {
        if (v == ff) continue;
        dfs(v, u);
        siz[u] += siz[v];
        if (v1) v2 = v;
        else v1 = v;
    }
    if (v1 && v2) {
        for (int i = 2; i <= M; ++i) {
            dp[u][i] = std::min(dp[u][i], std::min(std::min(dp[v1][i - 2], dp[v1][i - 1]) + dp[v2][i - 1], dp[v1][i - 1] + dp[v2][i - 2]));
        }
    }
    else if (v1) {
        dp[u][2] = siz[u] - 2;
    }
    dp[u][1] = siz[u] - 1;
}

int main() {
    memset(dp, 0x3f, sizeof(dp));
    int n;
    read(n);
    for (int i = 1; i < n; ++i) {
        int u, v;
        read(u), read(v);
        Vec[u].push_back(v), Vec[v].push_back(u);
    }
    dfs(1, 0);
    // for (int i = 1; i <= n; ++i)
    //     for (int j = 1; j <= 4; ++j) printf("%d%c", dp[i][j], " \n"[j == 4]);
    int ans = 0x3f3f3f3f;
    for (int i = 1; i <= M; ++i) ans = std::min(ans, dp[1][i]);
    printf("%d\n", ans);
    return 0;
}