#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 69;
int n, dp[N][2];
vector<int> g[N];
void dfs(int v, int u)
{
    for (auto it : g[v])
    {
        if (it != u)
            dfs(it, v);
    }
    if (g[v].size() > 1 || v == 1)
    {
        int sum = 0, mn = 1e8, vrtx = 0;
        for (auto it : g[v])
        {
            if (it != u)
            {
                sum += max(dp[1][it], dp[0][it]);
            }
        }
        // 0 je kad ne ucestvuje, 1 kad ucestvuje
        dp[0][v] = sum;
        for (auto it : g[v])
        {
            if (it != u)
            {
                dp[1][v] = max(dp[0][it] + 1 + sum - max(dp[1][it], dp[0][it]), dp[1][v]);
            }
        }
    }
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
	for (int i = 1;i <= n - 1;i++) {
		int a, b;
		cin >> a >> b;
		g[a].push_back(b);
		g[b].push_back(a);
	}
	dfs(1, 0);
	int m = max(dp[1][1], dp[1][0]);
	cout << 2 * n - 3 * m << endl;
}