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

const int N = 3e5+4;

vector<int> g[N];
int n;

int main() {
	scanf("%d", &n);
	for (int u, v, i = 0; i < n-1; ++i) {
		scanf("%d %d", &u, &v);
		g[u].push_back(v);
		g[v].push_back(u);
	}
	int ans = 0;
	for (int i = 1; i < N; ++i) {
		ans += max((int)(g[i].size() - 2), 0);
	}
	printf("%d", ans);
	
	return 0;
}