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

int ans = 0;

bool vis[300001];
vector<int> g[300001];

void dfs(int v) {
	vis[v] = true;
	bool inc = false;
	for (int u : g[v]) {
		if (vis[u]) continue;
		if (inc) ans++;
		else inc = true;
		dfs(u);
	}
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin>>n;
	for (int i=1;i<n;++i) {
		int a,b;
		cin >> a >> b;
		g[a].push_back(b);
		g[b].push_back(a);
	}
	for (int i = 1; i <= n; ++i) if(g[i].size() == 1u) { dfs(i); break; }
	cout << ans << '\n';
}