#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main(){
	int n;
	cin >> n;
	if(n == 1) return cout << 0, 0;
	vector<int> deg(n + 1);
	for(int i = 0; i < n - 1; i++){
		int x, y;
		cin >> x >> y;
		deg[x]++;
		deg[y]++;
	}
	int cnt = 0;
	for(int i = 1; i <= n; i++){
		cnt += (deg[i] == 1);
	}
	cout << cnt - 2 << endl;
}