#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
constexpr int MAXN = 2e5 + 10;

vector<int> sons[MAXN];
int d[MAXN];
int rem[MAXN];

void dfs0(const int n) {
	if (d[n] != -1)
		return;

	const int s0 = sons[n][0];
	const int s1 = sons[n][1];
	dfs0(s0);
	dfs0(s1);
	const int d0 = d[s0];
	const int d1 = d[s1];

	rem[s0] = rem[s1] = min(d0, d1) + 1;

	if (d0 == d1)
		d[n] = d0 + 1;
	else
		d[n] = min(d0, d1) + 2;
}

int ans = 0;
void dfs1(int n, int r) {
	if (n == 0)
		return;

	if (r <= 0)
		ans++;

	for (int s : sons[n])
		dfs1(s, min(r - 1, rem[s]));
}

int main() {
	int n;
	scanf("%d", &n);
	for (int i = 0, u, v; i < n - 1; i++) {
		scanf("%d %d", &u, &v);
		sons[u].push_back(v);
	}

	for (int i = 1; i <= n; i++)
		while (sons[i].size() < 2)
			sons[i].push_back(0);
	fill(d, d + n + 1, -1);
	fill(rem, rem + n + 1, 2 * n);
	d[0] = 0;
	dfs0(1);
	dfs1(1, 2 * n);

	printf("%d\n", ans);

	return 0;
}