#include <cstdio>
#include <algorithm>
#include <utility>
#include <vector>
using namespace std;
constexpr int MAXN = 200'005;

vector<int> g[MAXN];

pair<int, bool> dfs(int n, int p)
{
	int ans = 0;
	int cl = 0;
	for (int a : g[n])
		if (a != p)
		{
			auto d = dfs(a, n);
			ans += d.first;
			cl += d.second;
		}
	if (cl == 0)
		return {ans, 1};
	return {ans + 2 * (cl - 1) + 1, 0};
}

int main()
{
	int n;
	scanf("%d", &n);
	for (int i = 0, u, v; i < n - 1; i++)
	{
		scanf("%d %d", &u, &v);
		g[u].push_back(v);
		g[v].push_back(u);
	}
	auto p = dfs(1, 1);
	printf("%d\n", p.first + p.second);
	return 0;
}